Pages that link to "Item:Q3395046"
From MaRDI portal
The following pages link to The Price of Stability for Network Design with Fair Cost Allocation (Q3395046):
Displaying 50 items.
- Egalitarian-utilitarian bounds in Nash's bargaining problem (Q266513) (← links)
- Optimal cost sharing for capacitated facility location games (Q297094) (← links)
- Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- Implementing efficient graphs in connection networks (Q382330) (← links)
- Social context congestion games (Q386894) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← 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)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- Repeated congestion games with bounded rationality (Q444148) (← 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)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- Strong equilibrium in network congestion games: increasing versus decreasing costs (Q495760) (← links)
- Profit sharing with thresholds and non-monotone player utilities (Q506517) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Selfish bin packing (Q534779) (← links)
- Competitive cost sharing with economies of scale (Q547291) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- An efficient Nash-implementation mechanism for network resource allocation (Q608429) (← links)
- Local and global price of anarchy of graphical games (Q631783) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Congestion games with failures (Q642974) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- The efficiency of fair division (Q692886) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Bayesian ignorance (Q714780) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Strategic network formation through peering and service agreements (Q719870) (← links)
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221) (← links)
- Network design with weighted players (Q733733) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
- Distance hedonic games (Q831802) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Stability in the self-organized evolution of networks (Q848641) (← links)
- Minimum cost connection networks: truth-telling and implementation (Q894009) (← links)
- Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
- The price of envy-freeness in machine scheduling (Q899310) (← links)
- Capacitated network design games (Q904684) (← links)
- Congestion games with capacitated resources (Q904685) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
