Bidding Games: Theory and Applications

A graph game is a two-player game that is played on a graph: a token is placed on an initial vertex, and traditionally, the players alternate turns in moving it to produce an infinite path ("play") that determines the winner. In "bidding games", each player has a budget, and in each turn, we hold an auction (bidding) to determine which player moves the token. In the talk, I will describe results on "discrete" bidding games in which, motivated by practical considerations, the granularity of the budgets and bids is restricted. Time permitting, I will describe an application of bidding games in decoupled planning. 

Guy Avni's homepage: https://sites.google.com/view/gavni