Hierarchical Network Formation Games
From MaRDI portal
Publication:3303895
DOI10.1007/978-3-662-54577-5_13zbMath1457.91106OpenAlexW2600133316MaRDI QIDQ3303895
Publication date: 5 August 2020
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54577-5_13
Related Items (11)
An abstraction-refinement methodology for reasoning about network games ⋮ Unnamed Item ⋮ Network active systems: models of planning and incentives ⋮ Infinite-duration poorman-bidding games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dynamic resource allocation games ⋮ A Parametrized Analysis of Algorithms on Hierarchical Graphs ⋮ Unnamed Item ⋮ Infinite-Duration Bidding Games ⋮ Timed network games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network-formation games with regular objectives
- Improved model checking of hierarchical systems
- Worst-case equilibria
- Network design with weighted players
- Games with secure equilibria
- Weighted congestion games with separable preferences
- How easy is local search?
- Potential games
- The complexity of welfare maximization in congestion games
- Subgame Perfection for Equilibria in Quantitative Reachability Games
- On a network creation game
- Synthesis from Component Libraries with Costs
- 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
- On nash equilibria for a network creation game
- Nash Equilibrium for Upward-Closed Objectives
- On the power of bounded concurrency I
- Concepts in Programming Languages
- Conflicting Congestion Effects in Resource Allocation Games
- Algorithms, games, and the internet
- Computer Science Logic
- Selfish Routing in Capacitated Networks
This page was built for publication: Hierarchical Network Formation Games
