Network design with weighted players
From MaRDI portal
Publication:733733
DOI10.1007/S00224-008-9128-8zbMATH Open1176.91003OpenAlexW1991307017MaRDI QIDQ733733FDOQ733733
Publication date: 19 October 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9128-8
Recommendations
- Capacitated network design games with weighted players
- Network Design with Weighted Degree Constraints
- Network design with weighted degree constraints
- Network design in games with spillovers
- Stackelberg strategies for network design games
- ON THE CORE OF THE NETWORK DESIGN GAME
- A game-theoretic approach to network equilibrium
- The network of weighted majority rules and weighted majority games
- Network topology and equilibrium existence in weighted network congestion games
Nash equilibriumnetwork designalgorithmic game theoryprice of stabilitycost sharesShapley cost shares
Cites Work
- Equilibrium points in n -person games
- Title not available (Why is that?)
- A class of games possessing pure-strategy Nash equilibria
- Subjectivity and correlation in randomized strategies
- Potential games
- The Price of Stability for Network Design with Fair Cost Allocation
- Applications of approximation algorithms to cooperative games
- A Noncooperative Model of Network Formation
- Inefficiency of Nash Equilibria
- Strategyproof sharing of submodular costs: budget balance versus efficiency
- The price of anarchy of finite congestion games
- Title not available (Why is that?)
- Algorithms, games, and the internet
- Algorithms – ESA 2005
- The network equilibrium problem in integers
- On a network creation game
- On nash equilibria for a network creation game
- The price of selfish behavior in bilateral network formation
- The Price of Routing Unsplittable Flow
- Title not available (Why is that?)
- On the topologies formed by selfish peers
- Near-optimal network design with selfish agents
Cited In (43)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Improved lower bounds on the price of stability of undirected network design games
- Geometric spanner games
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Designing cost-sharing methods for Bayesian games
- Hierarchical Network Formation Games
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Enforcing efficient equilibria in network design games via subsidies
- On the existence of pure Nash equilibria in weighted congestion games
- On the Price of Stability of Undirected Multicast Games
- Optimal cost sharing for capacitated facility location games
- Cost-Sharing Scheduling Games on Restricted Unrelated Machines
- Non-cooperative queueing games on a network of single server queues
- Cost-sharing scheduling games on restricted unrelated machines
- Competitive cost sharing with economies of scale
- The Price of Stability of Weighted Congestion Games
- Equilibrium analysis of customer attraction games
- Designing Networks with Good Equilibria under Uncertainty
- Dynamic Resource Allocation Games
- Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
- The Price of Matching with Metric Preferences
- Network-formation games with regular objectives
- Non-cooperative facility location and covering games
- Cost-sharing games in real-time scheduling systems
- The ring design game with fair cost allocation
- Cost-sharing games with rank-based utilities
- Cost-sharing games in real-time scheduling systems
- Price of stability in survivable network design
- Tight Bounds for Cost-Sharing in Weighted Congestion Games
- Exact and approximate equilibria for optimal group network formation
- Characterizing the existence of potential functions in weighted congestion games
- Dynamics of Profit-Sharing Games
- Timing matters: online dynamics in broadcast games
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- Dynamic resource allocation games
- Restoring Pure Equilibria to Weighted Congestion Games
- Strategic multiway cut and multicut games
- Congestion games with variable demands
- A unifying approximate potential for weighted congestion games
This page was built for publication: Network design with weighted players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733733)
