Golden games

09/10/2019
by   Urban Larsson, et al.
0

We consider extensive form win-lose games over a complete binary-tree of depth n where players act in an alternating manner. We study arguably the simplest random structure of payoffs over such games where 0/1 payoffs in the leafs are drawn according to an i.i.d. Bernoulli distribution with probability p. Whenever p differs from the golden ratio, asymptotically as n→∞, the winner of the game is determined. In the case where p equals the golden ratio, we call such a random game a golden game. In golden games the winner is the player that acts first with probability that is equal to the golden ratio. We suggest the notion of fragility as a measure for "fairness" of a game's rules. Fragility counts how many leaves' payoffs should be flipped in order to convert the identity of the winning player. Our main result provides a recursive formula for asymptotic fragility of golden games. Surprisingly, golden games are extremely fragile. For instance, with probability ≈ 0.77 a losing player could flip a single payoff (out of 2^n) and become a winner. With probability ≈ 0.999 a losing player could flip 3 payoffs and become the winner.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2020

Some Game Theoretic Remarks on Two-Player Generalized Cops and Robbers Games

In this paper we study the two-player generalized Cops and Robber (GCR) ...
research
08/24/2023

Characterization of Potential Games: Application in Aggregative Games

The main objective of this work is to describe games which fall under ti...
research
04/30/2020

The Lipschitz Constant of Perturbed Anonymous Games

The worst-case Lipschitz constant of an n-player k-action δ-perturbed ga...
research
04/21/2021

Random perfect information games

The paper proposes a natural measure space of zero-sum perfect informati...
research
05/11/2020

Positional Games and QBF: The Corrective Encoding

Positional games are a mathematical class of two-player games comprising...
research
09/10/2018

Parameterized Games and Parameterized Automata

We introduce a way to parameterize automata and games on finite graphs w...
research
03/02/2018

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

In 2000 Allen Schwenk, using a well-known mathematical model of matchpla...

Please sign up or login with your details

Forgot password? Click here to reset