Recommendations
Cites work
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- Computing and Combinatorics
- How bad is selfish routing?
- Near-optimal network design with selfish agents
- Non-cooperative Facility Location and Covering Games
- Non-cooperative Tree Creation
- On a network creation game
- On nash equilibria for a network creation game
- Selfish Routing in Capacitated Networks
- Selfish traffic allocation for server farms
- The Price of Stability for Network Design with Fair Cost Allocation
- The price of anarchy in network creation games
- The price of selfish behavior in bilateral network formation
- The steiner problem in graphs
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Worst-case equilibria
Cited in
(15)- Geometric spanner games
- Near-optimal network design with selfish agents
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Competitive cost sharing with economies of scale
- Non-cooperative capacitated facility location games
- Non-cooperative facility location and covering games
- Resource buying games
- Price of stability in survivable network design
- Exact and approximate equilibria for optimal group network formation
- Non-cooperative Tree Creation
- Arbitrary profit sharing in federated learning utility games
- Approximative Nash-equilibria in network games
- Strategic cooperation in cost sharing games
- Strategic multiway cut and multicut games
This page was built for publication: Non-cooperative tree creation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017908)
