Using Auctions to Choose Time and Side in Armageddon Chess Games

This paper studies the problem of assigning sides and times in sudden-death chess games. We formulate it as a bargaining problem in which two goods must be allotted between two agents, allowing for compensations and payments.... [ view full abstract ]

This paper studies the problem of assigning sides and times in sudden-death chess games. We formulate it as a bargaining problem in which two goods must be allotted between two agents, allowing for compensations and payments. We design several mechanisms to address this problem, including classical auctions. Under a linear formulation, we look for the equilibria of these mechanisms. We also analyze interim properties of the general assignment rules. We find that auctions are efficient (and comparatively fairer) among the family of feasible rules.