Network-formation games with regular objectives
From MaRDI portal
Publication:342715
DOI10.1016/j.ic.2016.08.004zbMath1353.91012OpenAlexW2513087425MaRDI QIDQ342715
Tami Tamir, Orna Kupferman, Guy Avni
Publication date: 18 November 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.08.004
Noncooperative games (91A10) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
An abstraction-refinement methodology for reasoning about network games ⋮ Unnamed Item ⋮ Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical Network Formation Games ⋮ Dynamic resource allocation games ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ Infinite-Duration Bidding Games ⋮ Timed network games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coping with selfish on-going behaviors
- Worst-case equilibria
- Network design with weighted players
- Handbook of weighted automata
- Games with secure equilibria
- Weighted congestion games with separable preferences
- Potential games
- A class of games possessing pure-strategy Nash equilibria
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- Resource Competition on Integral Polymatroids
- On a network creation game
- Synthesis from Component Libraries with Costs
- From Reachability to Temporal Specifications in Cost-Sharing Games
- The Price of Stability for Network Design with Fair Cost Allocation
- Alternating-time temporal logic
- Congestion Games with Player-Specific Constants
- Strategy Logic
- Rational Synthesis
- The complexity of pure Nash equilibria
- On nash equilibria for a network creation game
- Nash Equilibrium for Upward-Closed Objectives
- Conflicting Congestion Effects in Resource Allocation Games
- Algorithms, games, and the internet
- Computer Science Logic
- Network-Formation Games with Regular Objectives
- The network equilibrium problem in integers
- Selfish Routing in Capacitated Networks
- Strategyproof sharing of submodular costs: budget balance versus efficiency
