Timed network games
From MaRDI portal
Publication:5111251
DOI10.4230/LIPICS.MFCS.2017.37zbMATH Open1441.91014MaRDI QIDQ5111251FDOQ5111251
Authors: Guy Avni, Shibashis Guha, Orna Kupferman 
Publication date: 26 May 2020
Recommendations
Formal languages and automata (68Q45) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Worst-case equilibria
- A theory of timed automata
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- Alternating-time temporal logic
- The Price of Stability for Network Design with Fair Cost Allocation
- What good are digital clocks?
- How easy is local search?
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- Simple Local Search Problems that are Hard to Solve
- Algorithms, games, and the internet
- Algorithms – ESA 2005
- Strategy Logic
- Rational synthesis
- Computer Science Logic
- Hierarchical network formation games
- Network-formation games with regular objectives
- Subgame perfection for equilibria in quantitative reachability games
- Nash Equilibrium for Upward-Closed Objectives
- Games with secure equilibria
- Title not available (Why is that?)
- Optimal paths in weighted timed automata
- On the optimal reachability problem of weighted timed automata
- Title not available (Why is that?)
- Nash equilibria and the price of anarchy for flows over time
- Competitive routing over time
- Exact price of anarchy for polynomial congestion games
- Title not available (Why is that?)
- Dynamic resource allocation games
- An abstraction-refinement methodology for reasoning about network games
- Repairing multi-player games
- Random order congestion games
- Contention issues in congestion games
Cited In (12)
- Formal Modeling and Analysis of Timed Systems
- Contention issues in congestion games
- Timed network games with clocks
- Development of an idempotent algorithm for a network-delay game
- Non-blind strategies in timed network congestion games
- Timed network games
- An abstraction-refinement methodology for reasoning about network games
- Infinite-duration bidding games
- Timing matters: online dynamics in broadcast games
- Computing the price of anarchy in atomic network congestion games (invited talk)
- Dynamic resource allocation games
- Algorithms and Computation
This page was built for publication: Timed network games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111251)
