Infinite-duration bidding games

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

Authors: Guy Avni, Ventsislav Chonev, Thomas A. Henzinger 

Publication date: 27 May 2020

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

Recommendations

• Infinite-duration Bidding Games
• Infinite-duration poorman-bidding games
• Bidding mechanisms in graph games
• scientific article; zbMATH DE number 7327943
• Bidding games on Markov decision processes

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
• Congestion games with multisets of resources and applications in synthesis
• 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?)
• One-counter Markov decision processes
• Bidding games and efficient allocations
• Discrete bidding games
• Sequential auctions and externalities
• 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
• Timed network games
• Repairing multi-player games
• Nash equilibria in concurrent games with Büchi objectives
• Controller Synthesis with Budget Constraints
• The sensing cost of monitoring and synthesis
• 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 (7)

• 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
• Bidding games on Markov decision processes

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)