# Determinacy in Discrete-Bidding Infinite-Duration Games

@article{Aghajohari2019DeterminacyID,
title={Determinacy in Discrete-Bidding Infinite-Duration Games},
author={Milad Aghajohari and Guy Avni and Thomas A. Henzinger},
journal={ArXiv},
year={2019},
volume={abs/1905.03588}
}
• Published 2019
• Computer Science
• ArXiv
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and… Expand
11 Citations

#### Figures and Topics from this paper

Infinite-Duration Poorman-Bidding Games
• Computer Science
• WINE
• 2018
The properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case, and quantitative poorman games, namely poorman mean-payoff games, where they construct optimal strategies depending on the initial ratio, are presented. Expand
Infinite-duration Bidding Games
• Computer Science
• J. ACM
• 2019
The key component of the proof is a quantitative solution to strongly connected mean-payoff bidding games in which the connection with random-turn games is extended to these games, and the higher bidder pays his bid to the other player and moves the token. Expand
A Survey of Bidding Games on Graphs
• 2020
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In bidding games, bothExpand
Bidding Games on Markov Decision Processes
• Computer Science
• RP
• 2019
A combination of bidding games with probabilistic behavior, namely, bidding games that are played on Markov decision processes, where the players bid for the right to choose the next action, which determines the probability distribution according to which the next vertex is chosen. Expand
All-Pay Bidding Games on Graphs
• Computer Science
• AAAI
• 2020
Solving the specific game in which \PO wins iff he wins the first two auctions, has been long stated as an open question, and is solved. Expand
Time-Aware Uniformization of Winning Strategies
Two-player win/lose games of infinite duration are involved in several disciplines including computer science and logic. If such a game has deterministic winning strategies, one may ask how simpleExpand
Time-aware uniformization of winning strategies
A sufficient condition is given such that if a player has winning strategies, she has one that prescribes the same action at equivalent histories, hence uniformization, and three corollaries follow for games with states and colors. Expand
Formal Methods for Industrial Critical Systems: 25th International Conference, FMICS 2020, Vienna, Austria, September 2–3, 2020, Proceedings
• Computer Science
• FMICS
• 2020
A Survey of Bidding Games on Graphs Guy Avni and Thomas A. Henzinger find that bidding games on graphs have changed in the past decade and are likely to change further in the coming years. Expand
Bidding mechanisms in graph games
• Computer Science
• J. Comput. Syst. Sci.
• 2021
Infinite-Duration All-Pay Bidding Games
• Computer Science, Economics
• SODA
• 2021
This work completely solve all-pay Richman games: a simple argument shows that deterministic strategies cannot guarantee anything in this model, and it is technically much more challenging to find optimal probabilistic strategies that achieve the same expected guarantees in a game as can be obtained with deterministic Strategies under first-price bidding. Expand

#### References

SHOWING 1-10 OF 44 REFERENCES
Determinacy in Discrete-Bidding Infinite-Duration Games
• Computer Science
• 2019
This work studies the combination of discrete-bidding and infinite-duration games, and proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. Expand
Infinite-Duration Poorman-Bidding Games
• Computer Science
• WINE
• 2018
The properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case, and quantitative poorman games, namely poorman mean-payoff games, where they construct optimal strategies depending on the initial ratio, are presented. Expand
Infinite-Duration Bidding Games
• Computer Science, Mathematics
• CONCUR
• 2017
The existence of threshold budgets are shown for a qualitative class of infinite-duration games, namely parity games, and a quantitative class, namely mean-payoff games, in which they extend the connection with random-turn games to theseGames, and construct explicit optimal strategies for both players. Expand
Bidding Mechanisms in Graph Games
• Mathematics, Computer Science
• MFCS
• 2019
The results show that Richman bidding is the exception; namely, for every $\tau <1$, the value of the game depends on the initial ratio. Expand
All-Pay Bidding Games on Graphs
• Computer Science
• AAAI
• 2020
Solving the specific game in which \PO wins iff he wins the first two auctions, has been long stated as an open question, and is solved. Expand
Bidding Games and Efficient Allocations
• Computer Science, Economics
• EC
• 2015
It is shown that if the underlying game has the form of a binary tree, then there exists a natural PSPE with the following highly desirable properties: players' utility is weakly monotone in their budget, and a Pareto-efficient outcome is reached for any initial budget. Expand
On Nash Equilibria in Stochastic Games
• Mathematics, Computer Science
• CSL
• 2004
It is shown that if each player has a reachability objective, that is, if the goal for each player i is to visit some subset of the states, then there exists an e-Nash equilibrium in memoryless strategies, for every e >0, however, exact Nash equilibria need not exist. Expand
Nash Equilibrium for Upward-Closed Objectives
It is established that values of an e-Nash equilibrium can be computed in TFNP (total functional NP), and hence in EXPTIME, by computing e-nash equilibrium values of nonzero-sum concurrent games with reachability objectives for all players and a polynomial procedure. Expand
Discrete All-Pay Bidding Games
• Computer Science, Economics
• ArXiv
• 2015
This work presents several results on the structures of optimal strategies in these games and gives a fast algorithm for computing such strategies for a large class of all-pay bidding games. Expand
Combinatorial Games under Auction Play
• Mathematics
• 1999
Abstract A Richman game is a combinatorial game in which, rather than alternating moves, the two players bid for the privilege of making the next move. The theory of such games is a hybrid betweenExpand