The following pages link to Worst-case equilibria (Q458478):
Displaying 41 items.
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- A Comparison of Game-Theoretic Models for Parallel Trade (Q4961345) (← links)
- Inequality and Network Formation Games (Q4985786) (← links)
- Asymptotic efficiency of the proportional compensation scheme for a large number of producers (Q4987799) (← links)
- Timed network games with clocks (Q5005123) (← links)
- (Q5009624) (← links)
- Nash Social Welfare Approximation for Strategic Agents (Q5031018) (← links)
- Asynchronous Horizons Durable-Strategies Dynamic Games and Tragedy of Cross-Generational Environmental Commons (Q5072230) (← links)
- Game efficiency through linear programming duality (Q5090446) (← links)
- Local verification of global proofs (Q5090917) (← links)
- (Q5092351) (← links)
- The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing (Q5108242) (← links)
- (Q5111251) (← links)
- Traffic assignment: on the interplay between optimization and equilibrium problems (Q5131827) (← links)
- Risk-Averse Selfish Routing (Q5219707) (← links)
- Location Games on Networks: Existence and Efficiency of Equilibria (Q5219715) (← links)
- Cost-Sharing in Generalised Selfish Routing (Q5283373) (← links)
- Prices of Anarchy of Selfish 2D Bin Packing Games (Q5384121) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- The Buck-Passing Game (Q5868932) (← links)
- Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction (Q5919605) (← links)
- Cost-sharing games in real-time scheduling systems (Q5925633) (← links)
- Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)
- Bounds on the welfare loss from moral hazard with limited liability (Q5964694) (← links)
- Tight bounds for the price of anarchy and stability in sequential transportation games (Q6053961) (← links)
- Data-trading coordination with government subsidy (Q6064053) (← links)
- Coordination mechanisms for scheduling games with machine modification (Q6070126) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
- Price of anarchy for parallel link networks with generalized mean objective (Q6103184) (← links)
- Cost-sharing games with rank-based utilities (Q6109525) (← links)
- Scheduling games with rank-based utilities (Q6160122) (← links)
- Using Temporal Dummy Players in Cost-Sharing Games (Q6165463) (← links)
- Selfish bin packing with punishment (Q6199400) (← links)
- Entrepreneurship facility-activation games (Q6546280) (← links)
- The price of equity with binary valuations and few agent types (Q6546299) (← links)
- A Stackelberg order execution game (Q6549606) (← links)
- Which is the worst-case Nash equilibrium? (Q6552473) (← links)
- On priority-proportional payments in financial networks (Q6614004) (← links)
- Pareto optimal provisions as outcomes of voluntary public good supply (Q6636907) (← links)
- Tight incentive analysis of Sybil attacks against the market equilibrium of resource exchange over general networks (Q6665695) (← links)
