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):
Displayed 50 items.
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games (Q989513) (← links)
- The path player game (Q1006556) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Mechanism design for set cover games with selfish element agents (Q1041237) (← links)
- The price of anarchy and stability in general noisy best-response dynamics (Q1621728) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
- Efficiency analysis with respect to the unit cost objectives in scheduling games (Q1645201) (← links)
- Sharing loading costs for multi compartment vehicles (Q1651904) (← links)
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks (Q1662512) (← links)
- Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
- A note on the efficiency of position mechanisms with budget constraints (Q1711420) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games (Q1755838) (← links)
- Improved bounds on equilibria solutions in the network design game (Q1757081) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Strategic multiway cut and multicut games (Q1946494) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Selfish vector packing (Q1979465) (← links)
- Simple combinatorial auctions with budget constraints (Q2006772) (← links)
- Incentive-based search for equilibria in Boolean games (Q2009196) (← links)
- Surrogate optimization for \(p\)-norms (Q2010926) (← links)
- Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost (Q2013315) (← links)
- The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- Price of Pareto optimality in hedonic games (Q2046008) (← links)
- Non-cooperative queueing games on a network of single server queues (Q2052440) (← links)
- Schelling games on graphs (Q2060699) (← links)
- Bounding the inefficiency of compromise in opinion formation (Q2072107) (← links)
- FIFO and randomized competitive packet routing games (Q2085747) (← links)
- On Pareto optimality in social distance games (Q2093365) (← links)
- A unifying approximate potential for weighted congestion games (Q2109950) (← links)
- Non-blind strategies in timed network congestion games (Q2112118) (← links)
- Timed network games (Q2112796) (← links)
- How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium (Q2140279) (← links)
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- Equilibria in routing games with edge priorities (Q2190414) (← links)
- The power of one evil secret agent (Q2196556) (← links)
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
- Bayesian generalized network design (Q2202025) (← links)