Infinite-Duration Bidding Games

DOI10.4230/LIPICS.CONCUR.2017.21zbMATH Open1448.91061OpenAlexW2964073379MaRDI QIDQ5111634FDOQ5111634

Ventsislav Chonev, Guy Avni, Thomas A. Henzinger

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/lipics.concur.2017.21

zbMATH Keywords

parity gamesmean-payoff gamesRichman gamesbidding games

Mathematics Subject Classification ID

2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Multistage and repeated games (91A20) Games involving graphs (91A43)

Cites Work

• Alternating-time temporal logic
• Title not available (Why is that?)
• Optimizing scrip systems: crashes, altruists, hoarders, sybils and collusion
• Reasoning about strategies
• Rational Synthesis
• Title not available (Why is that?)
• Computer Science Logic
• Title not available (Why is that?)
• Hierarchical Network Formation Games
• Network-formation games with regular objectives
• Subgame Perfection for Equilibria in Quantitative Reachability Games
• Title not available (Why is that?)
• Games with secure equilibria
• Strategy logic
• Secure equilibria in weighted games
• Approximating the Termination Value of One-Counter MDPs and Stochastic Games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bidding games and efficient allocations
• Discrete bidding games
• Title not available (Why is that?)
• Degrees of Lookahead in Regular Infinite Games
• Variations on the Stochastic Shortest Path Problem
• Title not available (Why is that?)
• Combinatorial games under auction play
• Dynamic Resource Allocation Games
• An abstraction-refinement methodology for reasoning about network games
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nash equilibria in concurrent games with Büchi objectives
• Controller Synthesis with Budget Constraints
• Title not available (Why is that?)
• Non-Zero Sum Games for Reactive Synthesis
• The Odds of Staying on Budget
• Analyzing Scrip Systems
• Infinite-Duration Bidding Games
• Gambler's ruin probability -- a general formula
• How Much Lookahead is Needed to Win Infinite Games?

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Infinite-Duration Bidding Games
• Infinite-duration Bidding Games
• Infinite-duration poorman-bidding games
• Dynamic resource allocation games

This page was built for publication: Infinite-Duration Bidding Games

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