Bidding Mechanisms in Graph Games

@article{Avni2019BiddingMI,
  title={Bidding Mechanisms in Graph Games},
  author={Guy Avni and T. Henzinger and Dorde Zikelic},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.03835}
}
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. We study {\em bidding games} in which the players bid for the right to move the token. Several bidding rules were studied previously. In {\em Richman} bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. {\em Poorman} bidding is similar except that the winner of the… 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
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
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
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
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
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 20 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
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
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
Bidding games and efficient allocations
TLDR
It is shown that PSPEs form a semilattice, with a unique and natural Bottom Equilibrium, showing the existence of pure subgame-perfect equilibria (PSPE). Expand
Robustness of Structurally Equivalent Concurrent Parity Games
TLDR
The problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity games with respect to imprecision in the transition probabilities is studied and the value continuity for structurally equivalent concurrent games is shown. Expand
Richman games
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. We find optimal strategies for both the case where aExpand
The Complexity of Mean Payoff Games on Graphs
TLDR
A pseudo-polynomial-time algorithm for the solution of mean payoff games on graphs, a family of perfect information games introduced by Ehrenfeucht and Mycielski and considered by Gurvich, Karzanov and Khachiyan, is described. Expand
Lectures in Game Theory for Computer Scientists
TLDR
This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Expand
The Complexity of Stochastic Games
  • A. Condon
  • Mathematics, Computer Science
  • Inf. Comput.
  • 1992
TLDR
It is shown that the problem of deciding which player has the greatest chance of winning the game is in the class NP ⌢ co- NP, which means that the complexity of stochastic games is considered. Expand
...
1
2
...