A class of games possessing pure-strategy Nash equilibria

DOI10.1007/BF01737559zbMath0259.90059MaRDI QIDQ2560099

Publication date: 1973

Published in: International Journal of Game Theory (Search for Journal in Brave)

91A10: Noncooperative games

Related Items

CONGESTION GAMES AND POTENTIALS RECONSIDERED, Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy, Window-Games between TCP Flows, Atomic Congestion Games: Fast, Myopic and Concurrent, Non-cooperative Cost Sharing Games Via Subsidies, HOW INDIVIDUALS LEARN TO TAKE TURNS: EMERGENCE OF ALTERNATING COOPERATION IN A CONGESTION GAME AND THE PRISONER'S DILEMMA, Minimum-effort coordination games: Stochastic potential and logit equilibrium, Potential games with continuous player sets, Best response equivalence, Network design with weighted players, Regular quantal response equilibrium, Congestion games with malicious players, Strong equilibrium in cost sharing connection games, Congestion games with load-dependent failures: Identical resources, The impact of local policies on the quality of packet routing in paths, trees, and rings, On the complexity of constrained Nash equilibria in graphical games, Coordination mechanisms, Atomic routing games on maximum congestion, Competitive online multicommodity routing, When ignorance helps: graphical multicast cost sharing games, Computing equilibria: a computational complexity perspective, The price of anarchy for polynomial social cost, Pigouvian pricing and stochastic evolutionary implementation, Discounted and finitely repeated minority games with public signals, A new model for selfish routing, Nash equilibria in discrete routing games with convex latency functions, How to find Nash equilibria with extreme total latency in network congestion games?, Brown's original fictitious play, Symmetries and the complexity of pure Nash equilibrium, Strong price of anarchy, Distributed consensus in noncooperative inventory games, Pure Nash equilibria in player-specific and weighted congestion games, Efficient graph topologies in network routing games, Strategic basins of attraction, the path dominance core, and network formation games, How hard is it to find extreme Nash equilibria in network congestion games?, Weighted congestion games with separable preferences, Two-terminal routing games with unknown active players, Equilibrium in a finite local public goods economy, Potentials in cooperative TU-games, Correlated equilibrium and potential games, Strong equilibrium in congestion games, Pure strategy Nash equilibrium in a group formation game with positive externalities, Equilibria and approximate equilibria in infinite potential games, How noise matters., Network structure and strong equilibrium in route selection games., Regret-based continuous-time dynamics., Social optimality and cooperation in nonatomic congestion games., A Shapley value representation of potential games, Competitive location, production, and market selection, Bounding the inefficiency of equilibria in nonatomic congestion games, Minimality of consistent solutions for strategic games, in particular for potential games, Axiomatic characterizations of solutions for Bayesian games, Potential maximizers and network formation, On the existence of a pure strategy Nash equilibrium in group formation games, Evolutionary equilibrium in Bayesian routing games: specialization and niche formation, Two-group knapsack game, Taxed congestion games with failures, Iterated potential and robustness of equilibria, A testable model of consumption with externalities, The cutting power of preparation, On the convergence of multicast games in directed networks, Congestion games revisited, Network potentials, Bounding the inefficiency of Nash equilibria in games with finitely many players, Stability of jurisdiction structures under the equal share and median rules, Selfish routing with incomplete information, Interactive decisions and potential games, An experimental study of costly coordination, Congestion network problems and related games, Games of competition in a stochastic environment, A geometric approach to the price of anarchy in nonatomic congestion games, The projection dynamic and the geometry of population games, A survey on networking games in telecommunications, Generalized potentials and robust sets of equilibria, Selfish unsplittable flows, Price floors and competition, Multicriteria games and potentials, Price competition with elastic traffic, Computing Approximate Nash Equilibria in Network Congestion Games, $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games, When Ignorance Helps: Graphical Multicast Cost Sharing Games, Malicious Bayesian Congestion Games, Management of Variable Data Streams in Networks, Asynchronous Congestion Games

Cites Work