scientific article; zbMATH DE number 7649928

DOI10.4230/LIPIcs.CONCUR.2019.20MaRDI QIDQ5875381

Guy Avni, Milad Aghajohari, Thomas A. Henzinger

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

determinacyconcurrent gamesbidding gamesdiscrete biddingrichman games

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Bidding mechanisms in graph games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network-formation games with regular objectives
• First-cycle games
• Games with secure equilibria
• Discrete bidding games
• Strategy logic
• Borel determinacy
• Combinatorial games under auction play
• An abstraction-refinement methodology for reasoning about network games
• Bidding games and efficient allocations
• Automata, logics, and infinite games. A guide to current research
• Infinite-duration poorman-bidding games
• Bidding chess
• Quantitative analysis of smart contracts
• Dynamic Resource Allocation Games
• Subgame Perfection for Equilibria in Quantitative Reachability Games
• Reasoning About Strategies
• Tug-of-war and the infinity Laplacian
• Hierarchical Network Formation Games
• Alternating-time temporal logic
• Rational Synthesis
• Nash Equilibrium for Upward-Closed Objectives
• The determinacy of Blackwell games
• Infinite-Duration Bidding Games
• Computer Science Logic
• Algorithmic Game Theory
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: