Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
On the complexity of schedule control problems for knockout tournaments
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Nonmanipulable selections from a tournament
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Complexity of mechanism design
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A Colonel Blotto Gladiator Game
Mathematics of Operations Research
Simulation of cross-border competitions of free Internet content providers
Computers in Industry
| Hi-index | 0.00 |
We consider a setting with two teams, each with a number of players. There is an ordering of all players that determines outcome of matches between any two players from the opposing teams. Neither the teams nor the competition designer know this ordering, but each team knows the derived ordering of strengths among its own players. Each team announces an ordering of its players, and the competition designer schedules matches according to the announced orderings. This setting in general allows for two types of manipulations by a team: Misreporting the strength ordering (lack of truthfulness), and deliberately losing a match (moral hazard). We prove necessary and sufficient conditions for a set of competition rules to have the properties that truthful reporting are dominant strategies and maximum effort in matches are Nash equilibrium strategies, and certain fairness conditions are met. Extensions of the original setting are discussed.