Milad Aghajohari ; Guy Avni ; Thomas A. Henzinger - Determinacy in Discrete-Bidding Infinite-Duration Games

lmcs:5977 - Logical Methods in Computer Science, February 3, 2021, Volume 17, Issue 1 - https://doi.org/10.23638/LMCS-17(1:10)2021
Determinacy in Discrete-Bidding Infinite-Duration Games

Authors: Milad Aghajohari ; Guy Avni ; Thomas A. Henzinger

In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets.


Volume: Volume 17, Issue 1
Published on: February 3, 2021
Accepted on: December 13, 2020
Submitted on: December 16, 2019
Keywords: Computer Science - Computer Science and Game Theory,Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 95 times.
This article's PDF has been downloaded 68 times.