scientific article; zbMATH DE number 7378340

DOI10.4230/LIPIcs.MFCS.2018.23MaRDI QIDQ5005123

Shibashis Guha, Orna Kupferman, Guy Avni

Publication date: 4 August 2021

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

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

zbMATH Keywords

Nash equilibriumtimed automataequilibrium inefficiencynetwork games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Non-blind strategies in timed network congestion games ⋮ Timed network games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network-formation games with regular objectives
• Worst-case equilibria
• Optimal paths in weighted timed automata
• Nash equilibria and the price of anarchy for flows over time
• The algorithmic analysis of hybrid systems
• Competitive routing over time
• Games with secure equilibria
• The temporal semantics of concurrent programs
• A theory of timed automata
• On the optimal reachability problem of weighted timed automata
• A class of games possessing pure-strategy Nash equilibria
• Dynamic Resource Allocation Games
• A Faster Algorithm for Solving One-Clock Priced Timed Games
• Subgame Perfection for Equilibria in Quantitative Reachability Games
• Energy and mean-payoff timed games
• Exact Price of Anarchy for Polynomial Congestion Games
• Contention Issues in Congestion Games
• Random Order Congestion Games
• Adding Negative Prices to Priced Timed Games
• How bad is selfish routing?
• Hierarchical Network Formation Games
• The Price of Stability for Network Design with Fair Cost Allocation
• Alternating-time temporal logic
• Strategy Logic
• Rational Synthesis
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Nash Equilibrium for Upward-Closed Objectives
• Algorithms, games, and the internet
• Computer Science Logic
• CONCUR 2004 - Concurrency Theory
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Lectures on Concurrency and Petri Nets
• Equilibrium points in n -person games
• Timed Parity Games: Complexity and Robustness

This page was built for publication: