Infinite-Duration All-Pay Bidding Games

  title={Infinite-Duration All-Pay Bidding Games},
  author={Guy Avni and Isma{\"e}l Jecker and Dorde Zikelic},
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", in each turn, we hold an 'auction' (bidding) to determine which player moves the token. The players simultaneously submit bids and the higher bidder moves the token. Several different payment schemes have been considered. In "first-price" bidding, only the higher bidder pays his bid, while in "all-pay… Expand
2 Citations

Figures from this paper

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


Infinite-Duration Poorman-Bidding Games
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
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
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
Determinacy in Discrete-Bidding Infinite-Duration Games
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
All-Pay Bidding Games on Graphs
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
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
Discrete All-Pay Bidding Games
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
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
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
Evolutionary dynamics of biological auctions.
The average bid in second price all- pay auctions is higher than in all-pay auctions, but the average cost for the winner is similar in both auctions, and the average bid is a declining function of the number of participants, n. Expand