Rationalizability of choice functions by game trees

DOI10.1016/J.JET.2006.01.002zbMATH Open1157.91329OpenAlexW2057074043MaRDI QIDQ2373789FDOQ2373789

Authors: Yongsheng Xu, Lin Zhou 

Publication date: 16 July 2007

Published in: Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jet.2006.01.002

Recommendations

• Rationalizability in games with a continuum of players
• On rationalizability in extensive games
• Rationalizability in continuous games
• On the concepts of rationalizability in games
• Rationalizability in multicriteria games
• Refinements of rationalizability for normal-form games
• Some rationalizability results for dynamic games
• Rationalizable strategies in random games
• Rationality in qualitative games
• Proof-theoretic analysis of rationality for strategic games with arbitrary strategy sets

zbMATH Keywords

separabilityrationalizabilitychoice functiongame treedivergence consistency

Mathematics Subject Classification ID

Decision theory (91B06) Individual preferences (91B08)

Cites Work

• Revealed Preference Theory
• Path Independence, Rationality, and Social Choice
• Choice Functions and Revealed Preference
• On the testable implications of collective choice theories
• Game theory via revealed preferences

Cited In (17)

• Pareto-optimal matching allocation mechanisms for boundedly rational agents
• Non-existence of continuous choice functions
• Bounded rationality is rare
• A foundation for strategic agenda voting
• Backwards-induction rationalizability of choice functions over an arbitrary set
• Every random choice rule is backwards-induction rationalizable
• The computational complexity of rationalizing Pareto optimal choice behavior
• Sophisticated Strategic Choice
• Every choice correspondence is backwards-induction rationalizable
• Choice structures in games
• The testable implications of zero-sum games
• Observable implications of Nash and subgame-perfect behavior in extensive games
• Weakened WARP and top-cycle choice rules
• The computational complexity of rationalizing boundedly rational choice behavior
• Every choice function is backwards-induction rationalizable
• A simple model of two-stage choice
• Cluster-shortlisted choice

This page was built for publication: Rationalizability of choice functions by game trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373789)