The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments

03/02/2018
by   Peter Hegarty, et al.
0

In 2000 Allen Schwenk, using a well-known mathematical model of matchplay tournaments in which the probability of one player beating another in a single match is fixed for each pair of players, showed that the classical single-elimination, seeded format can be "unfair" in the sense that situations can arise where an indisputibly better (and thus higher seeded) player may have a smaller probability of winning the tournament than a worse one. This in turn implies that, if the players are able to influence their seeding in some preliminary competition, situations can arise where it is in a player's interest to behave "dishonestly", by deliberately trying to lose a match. This motivated us to ask whether it is possible for a tournament to be both honest, meaning that it is impossible for a situation to arise where a rational player throws a match, and "symmetric" - meaning basically that the rules treat everyone the same - yet unfair, in the sense that an objectively better player has a smaller probability of winning than a worse one. After rigorously defining our terms, our main result is that such tournaments exist and we construct explicit examples for any number n >= 3 of players. For n=3, we show (Theorem 3.6) that the collection of win-probability vectors for such tournaments form a 5-vertex convex polygon in R^3, minus some boundary points. We conjecture a similar result for any n >= 4 and prove some partial results towards it.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2020

The tree search game for two players

We consider a two-player search game on a tree T. One vertex (unknown to...
research
04/24/2022

Fixing Knockout Tournaments With Seeds

Knockout tournaments constitute a popular format for organizing sports c...
research
09/10/2019

Golden games

We consider extensive form win-lose games over a complete binary-tree of...
research
01/10/2020

How to Cut a Cake Fairly: A Generalization to Groups

A fundamental result in cake cutting states that for any number of playe...
research
04/02/2018

Envy-free divisions of a partially burnt cake

Consider n players having preferences over the connected pieces of a cak...
research
09/18/2023

How to Make Knockout Tournaments More Popular?

Given a mapping from a set of players to the leaves of a complete binary...
research
02/21/2023

The Swiss Gambit

In each round of a Swiss-system tournament, players of similar score are...

Please sign up or login with your details

Forgot password? Click here to reset