Every Choice Function Is Pro-Con Rationalizable

• 成果类型: Article
• 署名作者: Dogan, Serhat; Yildiz, Kemal
• 署名单位: Ihsan Dogramaci Bilkent University
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2022.2312
• 发表日期: 2023
• 页码: 1857-1870
• 关键词: theorem; REPRESENTATION; MODEL

摘要

We consider an agent who is endowed with two sets of orderings: pro-and con orderings. For each choice set, if an alternative is the top-ranked by a pro-ordering (con-ordering), then this is a pro (con) for choosing that alternative. The alternative with more pros than cons is chosen from each choice set. Each ordering may have a weight reflecting its salience. In this case, the probability that an alternative is chosen equals the difference between the total weights of its pros and cons. We show that every nuance of the rich human choice behavior can be captured via this structured model. Our technique requires a generalization of the Ford-Fulkerson theorem, which may be of independent interest. As an application of our results, we show that every choice rule is plurality-rationalizable.