A Dynamic Foundation of the Rawlsian Maxmin Criterion

作者：Cho In Koo; Matsui Akihiko^*

来源：Dynamic Games and Applications, 2012, 2(1): 51-70.

DOI：10.1007/s13235-011-0026-3

• Matching
• Long-term relationship
• Procedural rationality
• Sympathy
• Rawlsian maxmin criterion

This paper rigorously examines a dynamic foundation of the maxmin criterion (also known as Rawlsian criterion), which selects a social outcome that maximizes the payoff of the worst-off agent. A society is populated with two types of equal and finite numbers of agents, row and column. When two agents, one from each type, are matched, a pair of non-transferable payoffs is drawn from a compact and convex set, and they simultaneously choose whether or not to agree to initiate a long term relationship. They actually form the relationship if they both agree to do so; otherwise, they obtain their respective disagreement payoffs and return to their respective pools of agents, waiting for the next period for a new match. Those who form a long term relationship can unilaterally choose to terminate their relationship in later periods, while if both agree to continue the relationship, they can do so with a high probability less than one. If their relationship is broken, they return to their respective pools as described above.
We focus on the outcomes sustained by a threshold decision rule slightly perturbed to incorporate sympathy in the spirit of Hume (A treatise of human nature. Oxford philosophical texts. Oxford University Press, London, 1978). For a general class of two person games, as the probability of continuing the long term relationship converges to 1, all agents in the economy almost always play the strongly Pareto efficient Rawlsian outcome, the most egalitarian outcome among strongly Pareto efficient outcomes. The Rawlsian criterion is generated through repeated long term interactions among agents in a decentralized fashion.

• 出版日期2012-3