Value-complexity tradeoff explains mouse navigational learning

Amir, Nadav

doi:10.17605/OSF.IO/3WGZX

Title	Authors

Value-complexity tradeoff explains mouse navigational learning

Contributors:

Nadav Amir

Date created: | Last Updated:

: DOI | ARK

Creating DOI. Please wait...

Create DOI

Category: Project

Description: Supplementary data for the paper "Value-complexity tradeoff explains mouse navigational learning" Amir et. al 2020. Including raw trajectory data and Matlab code for generating the figures.

License: CC0 1.0 Universal

Projects
Registrations

Results: All Projects Results: My Projects Results: All Registrations Results: My Registrations

Wiki

Add important information, links, or images here to describe your project.

Files

Files can now be accessed and managed under the Files tab.

Citation

Recent Activity

Loading logs...

OSF does not support the use of Internet Explorer. For optimal performance, please switch to another browser.

This website relies on cookies to help provide a better user experience. By clicking Accept or continuing to use the site, you agree. For more information, see our Privacy Policy and information on cookie use.

Start managing your projects on the OSF today.

Free and easy to use, the Open Science Framework supports the entire research lifecycle: planning, execution, reporting, archiving, and discovery.

Create an Account Learn More Hide this message

Main content

Links to this project

Value-complexity tradeoff explains mouse navigational learning

Link other OSF projects

Wiki

Files

Citation

Recent Activity

Start managing your projects on the OSF today.