Pages that link to "Item:Q3613794"
From MaRDI portal
The following pages link to On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations (Q3613794):
Displayed 34 items.
- Implementing efficient graphs in connection networks (Q382330) (← links)
- Social context congestion games (Q386894) (← links)
- Nash equilibria with minimum potential in undirected broadcast games (Q390911) (← links)
- The ring design game with fair cost allocation (Q476847) (← links)
- Improving the \(H_k\)-bound on the price of stability in undirected Shapley network design games (Q476904) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games (Q989513) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- Improved bounds on equilibria solutions in the network design game (Q1757081) (← links)
- How egalitarian are Nash equilibria in network cost-sharing games? (Q1785431) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- A unifying approximate potential for weighted congestion games (Q2109950) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)
- Dynamics in tree formation games (Q2636765) (← links)
- On the Price of Stability of Undirected Multicast Games (Q2959842) (← links)
- Improved Lower Bounds on the Price of Stability of Undirected Network Design Games (Q3162510) (← links)
- Multicast Network Design Game on a Ring (Q3467862) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002835) (← links)
- The Price of Stability of Weighted Congestion Games (Q5002839) (← links)
- (Q5002844) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
- The Price of Stability of Weighted Congestion Games (Q5242923) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)