Computing threshold budgets in discrete-bidding games

DOI10.46298/THEORETICS.25.5MaRDI QIDQ7016726zbMATH OpenFDO

Authors Guy Avni, Suman Sadhukhan

Publication date 6 March 2025

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/THEORETICS.25.5

zbMATH Keywords

discrete bidding gamesparity gamesreachability gamesRichman games

Mathematics Subject Classification ID

2-person games (91A05) Noncooperative games (91A10) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• A Survey of Bidding Games on Graphs (Invited Paper)
• Alternating-time temporal logic
• Bidding chess
• Bidding games and efficient allocations
• Bidding mechanisms in graph games
• Combinatorial games under auction play
• Computing threshold budgets in discrete-bidding games
• Determinacy in discrete-bidding infinite-duration games
• Discrete bidding games
• Discrete Richman-bidding scoring games
• scientific article; zbMATH DE number 5869590 (Why is no real title available?)
• scientific article; zbMATH DE number 3136785 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1775458 (Why is no real title available?)
• scientific article; zbMATH DE number 7799619 (Why is no real title available?)
• Infinite-duration Bidding Games
• Infinite-duration poorman-bidding games
• Quantitative analysis of smart contracts
• The complexity of stochastic games
• Tug-of-war and the infinity Laplacian

Cited in

(1)

• A game of pawns

This page was built for publication: Computing threshold budgets in discrete-bidding games

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