scientific article; zbMATH DE number 7204371
From MaRDI portal
Publication:5111251
DOI10.4230/LIPIcs.MFCS.2017.37zbMath1441.91014MaRDI QIDQ5111251
Orna Kupferman, Guy Avni, Shibashis Guha
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Formal languages and automata (68Q45) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (6)
An abstraction-refinement methodology for reasoning about network games ⋮ Unnamed Item ⋮ Dynamic resource allocation games ⋮ Infinite-Duration Bidding Games ⋮ Non-blind strategies in timed network congestion games ⋮ Timed network games
Cites Work
- 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
- Competitive routing over time
- Games with secure equilibria
- How easy is local search?
- A theory of timed automata
- An abstraction-refinement methodology for reasoning about network games
- On the optimal reachability problem of weighted timed automata
- A class of games possessing pure-strategy Nash equilibria
- Dynamic Resource Allocation Games
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- Exact Price of Anarchy for Polynomial Congestion Games
- Contention Issues in Congestion Games
- Random Order Congestion Games
- How bad is selfish routing?
- Simple Local Search Problems that are Hard to Solve
- Hierarchical Network Formation Games
- The Price of Stability for Network Design with Fair Cost Allocation
- On the impact of combinatorial structure on congestion games
- 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
- What good are digital clocks?
- Computer Science Logic
- Algorithms – ESA 2005
This page was built for publication:
