Abstract
We consider turn sequences used to allocate of a set of indivisible items between two players who take turns choosing their most desired element of the set, with the goal of minimizing the advantage of the first player. Balanced alternation, while not usually optimal, is fairer than alternation. Strategies for seeking the fairest choice sequence are discussed. We show an unexpected combinatorial connection between partition dominance and fairness, suggesting a new avenue for future investigations in this subject, and conjecture a connection to a previously studied optimality criterion. Several intriguing questions are open at multiple levels of accessibility.
Citation
William J. Keith. Sean Grindatti. "Fair choice sequences." Involve 12 (1) 13 - 30, 2019. https://doi.org/10.2140/involve.2019.12.13
Information