Discrete Richman-bidding scoring games

DOI10.1007/S00182-020-00753-XzbMATH Open1478.91042arXiv2003.05635OpenAlexW3120624317MaRDI QIDQ2230546FDOQ2230546

Authors: Ravi Kant Rai, Urban Larsson, Neel Patel 

Publication date: 24 September 2021

Published in: International Journal of Game Theory (Search for Journal in Brave)

Abstract: We study zero-sum (combinatorial) games, within the framework of so-called Richman auctions (Lazarus et al. 1996) namely, we modify the alternating play scoring ruleset Cumulative Subtraction (CS) (Cohensius et al. 2019), to a discrete bidding scheme (similar to Develin and Payne 2010). Players bid to move and the player with the highest bid wins the move, and hands over the winning bidding amount to the other player. The new game is dubbed Bidding Cumulative Subtraction (BCS). In so-called unitary games, players remove exactly one item out of a single heap of identical items, until the heap is empty, and their actions contribute to a common score, which increases or decreases by one unit depending on whether the maximizing player won the turn or not. We show that there is a unique bidding equilibrium for a much larger class of games, that generalize standard scoring play in the literature. We prove that for all sufficiently large heap sizes, the equilibrium outcomes of unitary BCS are eventually periodic, with period 2, and we show that the periodicity appears at the latest for heaps of sizes quadratic in the total budget.

Full work available at URL: https://arxiv.org/abs/2003.05635

Recommendations

• Bidding games and efficient allocations
• Discrete bidding games
• scientific article
• Combinatorial games under auction play
• Infinite-duration poorman-bidding games

zbMATH Keywords

combinatorial gamesdiscrete biddingRichman auctionscoring games

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Noncooperative games (91A10) Combinatorial games (91A46)

Cites Work

• Combinatorial game theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• The combinatorial game theory of well-tempered scoring games
• Guaranteed scoring games
• Title not available (Why is that?)
• Mean play of sums of positional games
• Bidding games and efficient allocations
• Discrete bidding games
• Title not available (Why is that?)
• Combinatorial games under auction play
• Game comparison through play
• Games with guaranteed scores and waiting moves
• Endgames in bidding chess
• Cumulative subtraction games

Cited In (7)

• Towards bidding Connect Four
• Endgames in bidding chess
• The game is not over yet: endgames in bidding chess
• A note on the wallet game with discrete bid levels
• Bidding combinatorial games
• Discrete bidding games
• Completely Mixed Discounted Bistochastic Games

This page was built for publication: Discrete Richman-bidding scoring games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230546)