Pages that link to "Item:Q3053150"
From MaRDI portal
The following pages link to Designing Network Protocols for Good Equilibria (Q3053150):
Displayed 30 items.
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- Nash equilibria with minimum potential in undirected broadcast games (Q390911) (← links)
- \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
- Topological price of anarchy bounds for clustering games on networks (Q777968) (← links)
- Minimum cost connection networks: truth-telling and implementation (Q894009) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- Truth-telling and Nash equilibria in minimum cost spanning tree models (Q1926969) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium (Q2140279) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context (Q2698591) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- Sharing Non-anonymous Costs of Multiple Resources Optimally (Q2947026) (← links)
- Optimal Cost-Sharing in General Resource Selection Games (Q2957453) (← links)
- Restoring Pure Equilibria to Weighted Congestion Games (Q3012946) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- Dynamics of Profit-Sharing Games (Q4985773) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- (Q5002844) (← links)
- (Q5111732) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares (Q5238743) (← links)
- Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing Games (Q5247620) (← links)
- Approximation algorithms for Steiner forest: An experimental study (Q6065858) (← links)