Near-optimal network design with selfish agents
From MaRDI portal
Recommendations
Cited in
(54)- Non-cooperative tree creation
- Strategic cooperation in cost sharing games
- Strategic multiway cut and multicut games
- Pricing traffic in a spanning network
- Geometric spanner games
- The price of anarchy for network formation in an adversary model
- Enforcing efficient equilibria in network design games via subsidies
- Equilibria in online games
- On approximate Nash equilibria in network design
- New results for network pollution games
- Cache me if you can: capacitated selfish replication games
- Equilibria in online games
- Designing network protocols for good equilibria
- The networked common goods game
- Minimizing Rosenthal potential in multicast games
- Non-cooperative capacitated facility location games
- Network formation games and the potential function method
- Who should pay for forwarding packets?
- Near-optimal network design with selfish agents
- Exact and Approximate Equilibria for Optimal Group Network Formation
- Nash equilibria with minimum potential in undirected broadcast games
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games
- Selfish bin coloring
- Emergency connectivity in ad-hoc networks with selfish nodes
- Resource buying games
- Capacitated network design games
- Minimizing Rosenthal potential in multicast games
- LP-based covering games with low price of anarchy
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Equilibria of Games in Networks for Local Tasks
- Network movement games
- Designing networks with good equilibria under uncertainty
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- Bottleneck links, variable demand, and the tragedy of the commons
- Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
- Competitive cost sharing with economies of scale
- A game theoretic analysis of network design with socially-aware users
- Computing and Combinatorics
- Non-cooperative Tree Creation
- Social distancing network creation
- Geometric Network Creation Games
- Graphical congestion games
- Arbitrary profit sharing in federated learning utility games
- Selfish network creation with non-uniform edge cost
- Fair tree connection games with topology-dependent edge cost
- The price of fairness and stability in resource buying games
- Competitive mechanisms for energy-efficient cloud computing
- The price of anarchy of strategic queuing systems
- Exact and approximate equilibria for optimal group network formation
- Strategic network formation through peering and service agreements
- Logit dynamics with concurrent updates for local interaction potential games
- Capacitated network design games
- Non-cooperative facility location and covering games
This page was built for publication: Near-optimal network design with selfish agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002793)
