Every Choice Function Is Pro-Con Rationalizable

DOI10.1287/OPRE.2022.2312MaRDI QIDQ6195083zbMATH OpenOpenAlexFDO

Authors Serhat Doğan, Kemal Yıldız

Publication date 12 March 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/111711

zbMATH Keywords

additivityinteger programmingrandom choicechoice functionattraction effect

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Rationalizing Choice Functions By Multiple Rationales
• Falmagne and the Rationalizability of Stochastic Choices in Terms of Random Orderings
• A canon of probabilistic rationality
• Rationalizable choice functions
• Probabilistic choice and procedurally bounded rationality

Cited in

(2)

• Rationalization of indecisive choice behavior by pluralist ballots
• The limits of identification in discrete choice

This page was built for publication: Every Choice Function Is Pro-Con Rationalizable

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