The following pages link to Inefficiency of Nash Equilibria (Q3722301):
Displaying 18 items.
- Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games (Q4230626) (← links)
- Asynchronous Horizons Durable-Strategies Dynamic Games and Tragedy of Cross-Generational Environmental Commons (Q5072230) (← links)
- The Value of Information in Selfish Routing (Q5100972) (← links)
- Price of Anarchy in Networks with Heterogeneous Latency Functions (Q5119855) (← links)
- On the (In)efficiency of MFG Equilibria (Q5232224) (← links)
- Complexity and Approximation of the Continuous Network Design Problem (Q5348461) (← links)
- New bounds for the price of anarchy under nonlinear and asymmetric costs (Q5413885) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)
- Chaotic itinerancy in coupled dynamical recognizers (Q5706414) (← links)
- The price of anarchy is independent of the network topology (Q5917582) (← links)
- Braess' paradox: A cooperative game‐theoretic point of view (Q6065828) (← links)
- Preference revelation games and strict cores of multiple‐type housing market problems (Q6074889) (← links)
- Price of anarchy for parallel link networks with generalized mean objective (Q6103184) (← links)
- (Q6114085) (← links)
- Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly (Q6178114) (← links)
- The calculation and simulation of the price of anarchy for network formation games (Q6195268) (← links)
- Game-theoretic analysis of the interaction of economic agents in the Cournot oligopoly with consideration of the linear structure, the green effect, and fairness concern (Q6581778) (← links)
- Stochastic approximation for estimating the price of stability in stochastic Nash games (Q6639389) (← links)