Infinite-Duration Poorman-Bidding Games

@inproceedings{Avni2018InfiniteDurationPG,
  title={Infinite-Duration Poorman-Bidding Games},
  author={Guy Avni and T. Henzinger and Rasmus Ibsen-Jensen},
  booktitle={WINE},
  year={2018}
}
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder… 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 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 Bidding Games
TLDR
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
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
Bidding Games on Markov Decision Processes
TLDR
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
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
Bidding Mechanisms in Graph Games
TLDR
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
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
Bidding mechanisms in graph games
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 55 REFERENCES
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 Bidding Games
TLDR
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 Games on Markov Decision Processes
TLDR
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
Bidding Mechanisms in Graph Games
TLDR
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
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
Bidding Games and Efficient Allocations
TLDR
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
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
On Nash Equilibria in Stochastic Games
TLDR
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
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
...
1
2
3
4
5
...