Rationalizability of choice functions on general domains without full transitivity

DOI10.1007/S00355-006-0132-0zbMath1142.91435OpenAlexW2104879829MaRDI QIDQ857971

Walter Bossert, Kotaro Suzumura, Yves Sprumont

Publication date: 5 January 2007

Published in: Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1866/353

Mathematics Subject Classification ID

Social choice (91B14)

Related Items (14)

Matrix representation of a binary relation using fuzzy and artificial learning theory. An algorithm which uses the potential functions learning rule ⋮ Nash equilibria of games when players’ preferences are quasi‐transitive ⋮ WARP and combinatorial choice ⋮ Full Rationality of Fuzzy Choice Functions on Base Domain Through Indicators ⋮ Von Neumann-Morgenstern stable set rationalization of choice functions ⋮ Rationality, external norms, and the epistemic value of menus ⋮ Behavioral implications of shortlisting procedures ⋮ Domain closedness conditions and rational choice ⋮ Transitive and acyclic rationality indicators of fuzzy choice functions on base domain ⋮ Maximal-element rationalizability ⋮ Rationalizability of menu preferences ⋮ Suzumura Consistency ⋮ Satisficing behavior with a secondary criterion ⋮ ON THE FULL RATIONALITY OF FUZZY CHOICE FUNCTIONS ON BASE DOMAIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Note on preference and axioms of choice
• Nontransitive-nontotal consumer theory
• Houthakker's axiom in the theory of rational choice
• Choice functions, rationality conditions, and variations on the weak axiom of revealed preference
• Choices, consequences, and rationality
• Choice structures and preference relations
• Rational Choice and Revealed Preference
• Maximization and the Act of Choice
• Revealed Preference Theory
• Choice Functions and Revealed Preference
• Ordinal Preference and Rational Choice

This page was built for publication: Rationalizability of choice functions on general domains without full transitivity