Network-formation games with regular objectives

DOI10.1016/J.IC.2016.08.004MaRDI QIDQ342715zbMATH OpenOpenAlexFDO

Authors Guy Avni, Orna Kupferman, Tami Tamir

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

zbMATH Keywords

inefficiencyNash equilibriaweighted automatanetwork-formation gameson-going behaviors

Mathematics Subject Classification ID

Noncooperative games (91A10) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• Network-formation games with regular objectives
• From reachability to temporal specifications in cost-sharing games
• Costly network formation and regular equilibria
• Hierarchical network formation games
• The Price of Anarchy in Network Creation Games Is (Mostly) Constant

Cites work

• scientific article; zbMATH DE number 3930354 (Why is no real title available?)
• scientific article; zbMATH DE number 708802 (Why is no real title available?)
• scientific article; zbMATH DE number 895368 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Algorithms, games, and the internet
• Alternating-time temporal logic
• Computer Science Logic
• Conflicting congestion effects in resource allocation games
• Congestion Games with Player-Specific Constants
• Congestion games with multisets of resources and applications in synthesis
• Coping with selfish on-going behaviors
• From reachability to temporal specifications in cost-sharing games
• Games with secure equilibria
• Handbook of weighted automata
• Nash Equilibrium for Upward-Closed Objectives
• Network design with weighted players
• Network formation games and the potential function method
• Network-formation games with regular objectives
• On a network creation game
• On nash equilibria for a network creation game
• Potential games
• Rational synthesis
• Resource competition on integral polymatroids
• Selfish Routing in Capacitated Networks
• Strategy Logic
• Strategyproof sharing of submodular costs: budget balance versus efficiency
• Subgame perfection for equilibria in quantitative reachability games
• Synthesis from component libraries with costs
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• The network equilibrium problem in integers
• Weighted congestion games with separable preferences
• Worst-case equilibria

Cited in

(16)

• Towards a solution concept for network formation games
• Timed network games with clocks
• Timed network games
• scientific article; zbMATH DE number 7327943 (Why is no real title available?)
• scientific article; zbMATH DE number 7649928 (Why is no real title available?)
• An abstraction-refinement methodology for reasoning about network games
• Timed network games
• Network-formation games with regular objectives
• Regular Networks Unification in Games with Stochastic Parameters
• Network formation games with teams
• Cost-sharing games in real-time scheduling systems
• Infinite-duration bidding games
• Infinite-duration poorman-bidding games
• Hierarchical network formation games
• Dynamic resource allocation games
• From reachability to temporal specifications in cost-sharing games

This page was built for publication: Network-formation games with regular objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342715)