Infinite-Duration Bidding Games

@inproceedings{Avni2017InfiniteDurationBG,
  title={Infinite-Duration Bidding Games},
  author={Guy Avni and Ventsislav Chonev and T. Henzinger},
  booktitle={CONCUR},
  year={2017}
}
Two-player games on graphs are widely studied in formal methods as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the {\em bidding} mode of moving the token, which, to the best of our knowledge, has never been studied… Expand
Infinite-duration Bidding Games
TLDR
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
Determinacy in Discrete-Bidding Infinite-Duration Games
TLDR
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 {\em determinacy} is the strong property that there always exists exactly one player who can guarantee winning the game. Expand
Infinite-Duration Poorman-Bidding Games
TLDR
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 All-Pay Bidding Games
TLDR
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
A Survey of Bidding Games on Graphs
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
All-Pay Bidding Games on Graphs
TLDR
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
Dynamic resource allocation games
TLDR
It is argued that the dynamic setting is the suitable setting for many applications in practice, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability. Expand
Register Games on Infinite Ordered Data Domains
TLDR
Two-player turn-based zero-sum register games on an infinite linearly ordered data domain are introduced and the decidability of register games over data domains N and Q is shown, showing that they can be solved in ExpTime and finite-memory strategies always suffice to win. Expand
Formal Methods for Industrial Critical Systems: 25th International Conference, FMICS 2020, Vienna, Austria, September 2–3, 2020, Proceedings
TLDR
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

References

SHOWING 1-10 OF 61 REFERENCES
Infinite-duration Bidding Games
TLDR
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
Infinite-Duration Poorman-Bidding Games
TLDR
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
On Nash equilibria in stochastic games
We study infinite stochastic games played by n-players on a finite graph with goals given by sets of infinite traces. The games are stochastic (each player simultaneously and independently chooses anExpand
Pure Nash Equilibria in Concurrent Deterministic Games
TLDR
A novel construction is provided, called the suspect game, which transforms a multi-player concurrent game into a two-player turn-based game which turns Nash equilibria into winning strategies (for some objective that depends on the preference relations of the players in the original game). Expand
Combinatorial Games under Auction Play
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
Dynamic Resource Allocation Games
TLDR
It is argued that the dynamic setting is the suitable setting for many applications in practice, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability. Expand
Nash Equilibrium for Upward-Closed Objectives
TLDR
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 bidding games
We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetricExpand
Timed Network Games
TLDR
The answer to the question whether the authors can restrict attention to boundary strategies, namely ones in which edges are traversed only at the boundaries of guards, is mixed and is shown to be mixed. Expand
Repairing Multi-Player Games
TLDR
This work solves the problem of modifying the winning conditions in a given concurrent multi-player game in a way that guarantees the existence of a Nash equilibrium. Expand
...
1
2
3
4
5
...