Extending the notion of rationality of selfish agents: second order Nash equilibria

DOI10.1016/J.TCS.2011.01.008zbMATH Open1211.91015OpenAlexW2131042067MaRDI QIDQ533871FDOQ533871

Authors: Vittorio Bilò, Michele Flammini 

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.008

Recommendations

• Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria
• Rationalizable conjectural equilibrium: Between Nash and rationalizability
• \(n\)-person second-order games: A paradigm shift in game theory
• On Nash equilibrium. II
• On the Interpretation of the Nash Bargaining Solution and Its Extension to Non-Expected Utility Preferences
• Differentiable Nash equilibria in altruistic economies
• A minimally altruistic refinement of Nash equilibrium
• Cooperation and self-interest: Pareto-inefficiency of Nash equilibria in finite random games
• On voluntariness of Nash equilibrium
• Dynamics and rationality in ordered externality games

zbMATH Keywords

Nash equilibriaalgorithmic game theoryrational behavior

Mathematics Subject Classification ID

Noncooperative games (91A10) Other game-theoretic models (91A40) Rationality and learning in game theory (91A26)

Cites Work

• Non-cooperative games
• Equilibrium points in n -person games
• Title not available (Why is that?)
• Worst-case equilibria
• The price of anarchy is independent of the network topology
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• Title not available (Why is that?)
• Über ein Paradoxon aus der Verkehrsplanung
• Subjectivity and correlation in randomized strategies
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Tight bounds for worst-case equilibria
• On the Strategic Stability of Equilibria
• Traffic assignment problem for a general network
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• The price of selfish routing
• Sequential Equilibria
• Learning, Mutation, and Long Run Equilibria in Games
• Approximate equilibria and ball fusion
• Convergence time to Nash equilibrium in load balancing
• Title not available (Why is that?)
• Algorithms, games, and the internet
• On a network creation game
• Selfish traffic allocation for server farms
• Noncooperative farsighted stable set in an \(n\)-player prisoners' dilemma
• Automata, Languages and Programming
• Title not available (Why is that?)
• Acceptable points in games of perfect information
• Forward looking Nash equilibrium for keyword auction
• Structure and complexity of extreme Nash equilibria
• Near-optimal network design with selfish agents
• Far-sighted equilibria in 2\(\times 2\), non-cooperative, repeated games
• STACS 2004
• Mathematical Foundations of Computer Science 2003
• Automata, Languages and Programming
• STACS 2005
• Equilibria for far-sighted players

Cited In (4)

• Some anomalies of farsighted strategic behavior
• Perfect prediction in normal form: superrational thinking extended to non-symmetric games
• On the sequential price of anarchy of isolation games
• Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria

This page was built for publication: Extending the notion of rationality of selfish agents: second order Nash equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533871)