A duality principle for selection games

Author:

Levine Lionel,Sheffield Scott,Stange Katherine

Abstract

A dinner table seats k k guests and holds n n discrete morsels of food. Guests select morsels in turn until all are consumed. Each guest has a ranking of the morsels according to how much he would enjoy eating them; these rankings are commonly known.

A gallant knight always prefers one food division over another if it provides strictly more enjoyable collections of food to one or more other players (without giving a less enjoyable collection to any other player), even if it makes his own collection less enjoyable. A boorish lout always selects the morsel that gives him the most enjoyment on the current turn regardless of future consumption by himself and others.

We show that the way the food is divided when all guests are gallant knights is the same as when all guests are boorish louts, but turn order is reversed. This implies and generalizes a classical result of Kohler and Chandrasekaran (1971) about two players strategically maximizing their own enjoyments. We also treat the case where the table contains a mixture of boorish louts and gallant knights.

Our main result can also be formulated in terms of games in which selections are made by groups. In this formulation, the surprising fact is that a group can always find a selection that is simultaneously optimal for each member of the group.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference5 articles.

1. Equilibria problems on games: complexity versus succinctness;Àlvarez, Carme;J. Comput. System Sci.,2011

2. Prisoner’s dilemma and professional sports drafts;Brams, Steven J.;Amer. Math. Monthly,1979

3. S. J. Brams and A. D. Taylor, The win-win solution, Norton, 1999.

4. A class of sequential games;Kohler, David A.;Operations Res.,1971

5. How to make the most of a shared meal: plan the last bite first;Levine, Lionel;Amer. Math. Monthly,2012

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. How to decompose a permutation into a pair of labeled Dyck paths by playing a game;Proceedings of the American Mathematical Society;2015-01-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3