Prediction, Inference, and Choice

Information

  • NSF Award
  • 2417162
Owner
  • Award Id
    2417162
  • Award Effective Date
    9/1/2024 - a year ago
  • Award Expiration Date
    8/31/2027 - a year from now
  • Award Amount
    $ 272,750.00
  • Award Instrument
    Standard Grant

Prediction, Inference, and Choice

This research focuses on understanding how people make decisions and interact based on information. One part explores the long-run implications of people not fully accounting for the ways that their memory can be limited or imperfect, which can lead them to, for example, overestimate their abilities and/or neglect large but infrequent losses. This work has important implications for such macroeconomic issues as why stocks tend to outperform bonds even after correcting for risk, and also helps explain why people’s decisions can seem random. Another part delves into how people decide whether to share stories on social media. The research also examines how community dynamics influence cooperative behavior among interacting partners, which is important for understanding how societies function. The project also explores the behavior of agents who prefer to be surprised, such as those who prefer watching a close sports game to one where their preferred team is almost sure to win; this has implications for voter turnout and online gambling. Lastly, the research develops a method to evaluate theories that predict behavior across different situations, comparing economic models with machine-learning algorithms. This approach is valuable across economics disciplines including development, industrial organization, labor economics, and public finance.<br/><br/>The work on limited memory assumes that agents only remember a random subset of their past experiences and that agents are naive about this. It shows that the agent’s long-run behavior satisfies a fixed-point condition that is formalized as a limited memory equilibrium. The research relates limited-memory equilibrium to the literature on stochastic choice, and also considers how closely the behavior of agents with “almost unlimited” but imperfect memory approximates that of agents with perfect memory. The work on social media starts from the premise that people prefer to share accurate content they will pay an attention cost to distinguish true content from false. This research uses results on stochastic approximation via differential inclusions and extends previous results on generalized Polya urns to urn systems that are only piecewise continuous. The work on community enforcement studies how people who interact with a series of partners can use information about their current partner’s past behavior to guide how they interact with them now. With the same technology,<br/>self-interested cooperation is less efficient in these settings than in fixed partnerships, but this can be offset by gains from specialization. The research analyzes how the tradeoff between these two forms of social organization varies with the parameters of the interaction. The work on risk and surprise uses results from convex analysis and optimal transport to analyze all concave preferences over risky lotteries that satisfy a form of smoothness condition. It shows how to view any such preference as arising from a taste for surprise, and uses this interpretation to develop new and tractable models of risk preference as well as new interpretations and results for some existing models. The work on transfer performance provides a tractable approach for evaluating cross-domain transfer performance--how accurately will a model estimated on one domain (e.g. a ountry or a set of lotteries) generalize to a new domain--based on techniques that generalize conformal inference by allowing behavior in different domains to be governed by different distributions that are themselves drawn identically and independently from a fixed but unknown meta-distribution. It derives finite-sample forecast intervals for a large class of measures of transfer performance that can be used to evaluate both economic models and black box algorithms. It then uses these forecast intervals to compare the generalizability of economic models and machine learning methods when predicting certainty equivalents for lotteries.<br/><br/>This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

  • Program Officer
    Nancy Lutznlutz@nsf.gov7032927280
  • Min Amd Letter Date
    7/22/2024 - a year ago
  • Max Amd Letter Date
    7/22/2024 - a year ago
  • ARRA Amount

Institutions

  • Name
    Massachusetts Institute of Technology
  • City
    CAMBRIDGE
  • State
    MA
  • Country
    United States
  • Address
    77 MASSACHUSETTS AVE
  • Postal Code
    021394301
  • Phone Number
    6172531000

Investigators

  • First Name
    Drew
  • Last Name
    Fudenberg
  • Email Address
    drew.fudenberg@gmail.com
  • Start Date
    7/22/2024 12:00:00 AM

Program Element

  • Text
    Economics
  • Code
    132000

Program Reference

  • Text
    GRADUATE INVOLVEMENT
  • Code
    9179