Inefficiency of Nash Equilibria
From MaRDI portal
Publication:3722301
DOI10.1287/moor.11.1.1zbMath0592.90100OpenAlexW2151960821WikidataQ96323507 ScholiaQ96323507MaRDI QIDQ3722301
Publication date: 1986
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/bb3c7f956b055b18fa636255db6c4537b369a3ad
Related Items (61)
A survey of static and dynamic potential games ⋮ Cooperative and non-cooperative Nash solution for linear supply function equilibrium game ⋮ Bayesian cooperative choice of strategies ⋮ Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games ⋮ What to maximize if you must ⋮ Selfish Vector Packing ⋮ Random extensive form games ⋮ Linear-quadratic mean-field-type games: a direct method ⋮ The hybrid equilibria and core selection in exchange economies with externalities ⋮ Asynchronous Horizons Durable-Strategies Dynamic Games and Tragedy of Cross-Generational Environmental Commons ⋮ Scheduling selfish jobs on multidimensional parallel machines ⋮ Interference game for intelligent sensors in cyber-physical systems ⋮ Robust market equilibria under uncertain cost ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Complexity and Approximation of the Continuous Network Design Problem ⋮ The Value of Information in Selfish Routing ⋮ The price of anarchy for utilitarian scheduling games on related machines ⋮ Braess' paradox: A cooperative game‐theoretic point of view ⋮ Preference revelation games and strict cores of multiple‐type housing market problems ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Pareto optimal equilibria for selfish bin packing with uniform cost sharing ⋮ Robustness analysis of urban road networks from topological and operational perspectives ⋮ Comparison of methods of organization and management efficiency in dynamic models of Cournot oligopoly ⋮ The calculation and simulation of the price of anarchy for network formation games ⋮ Competitive behavior in market games: evidence and theory ⋮ Game-theoretic static load balancing for distributed systems ⋮ Price of Anarchy in Networks with Heterogeneous Latency Functions ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context ⋮ Mean-field type games between two players driven by backward stochastic differential equations ⋮ Unnamed Item ⋮ Multi-level programming and conflict resolution ⋮ The equilibria of a multiple objective game ⋮ Pareto improvements of Nash equilibria in differential games ⋮ Competitive contagion in networks ⋮ Chaotic itinerancy in coupled dynamical recognizers ⋮ Selfish vector packing ⋮ Efficient Markov perfect Nash equilibria: theory and application to dynamic fishery games ⋮ New bounds for the price of anarchy under nonlinear and asymmetric costs ⋮ Prices of anarchy, information, and cooperation in differential games ⋮ GLAD: a simple adaptive strategy that yields cooperation in dilemma games ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Strong Nash equilibria and mixed strategies ⋮ Magnitude of inefficiency ⋮ The price of anarchy is independent of the network topology ⋮ Network design with weighted players ⋮ Service rate control of closed Jackson networks from game theoretic perspective ⋮ Nonadaptive Selfish Routing with Online Demands ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ Regularity and robustness in monotone Bayesian games ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ Traffic congestion pricing via network congestion game approach ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ On the (In)efficiency of MFG Equilibria ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Pareto Nash equilibrium seeking for switched differential games ⋮ On the existence of strong Nash equilibria ⋮ Collusive game solutions via optimization ⋮ Regular equilibria and negative welfare implications in delegation games ⋮ Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games ⋮ Bounds on price of anarchy on linear cost functions
This page was built for publication: Inefficiency of Nash Equilibria
