Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Coalition-proof Nash equilibrium

From Wikipedia, the free encyclopedia
Coalition-proof Nash equilibrium
Solution concept ingame theory
Relationship
Subset ofNash Equilibrium
Superset ofStrong Nash equilibrium
Significance

The concept ofcoalition-proof Nash equilibrium applies to certain "noncooperative" environments in which players can freely discuss their strategies but cannot make binding commitments.[1]It emphasizes the immunization to deviations that are self-enforcing. While the best-response property inNash equilibrium is necessary for self-enforceability, it is not generally sufficient when players can jointly deviate in a way that is mutually beneficial.

TheStrong Nash equilibrium is criticized as too "strong" in that the environment allows for unlimited private communication.[1] In the coalition-proof Nash equilibrium the private communication is limited.[1]

Definition

[edit]

Informally:At first all players are in a room deliberating their strategies. Then one by one, they leave the room fixing their strategy and only those left are allowed to change their strategies, both individually and together.

Formal definition:[1]

  1. In a single player, single stage gameΓ{\displaystyle \Gamma },sS{\displaystyle s^{\ast }\in S} is a Perfectly Coalition-Proof Nash equilibriumif and only ifs{\displaystyle s^{\ast }} maximizesg1(s){\displaystyle g^{1}(s)}.
  2. Let(n,t)(1,1){\displaystyle (n,t)\neq (1,1)}. Assume that a Perfectly Coalition-Proof Nash equilibrium has been defined for all games withm{\displaystyle m} players ands{\displaystyle s} stages, where(m,s)(n,t){\displaystyle (m,s)\leq (n,t)}, and(m,s)(n,t){\displaystyle (m,s)\neq (n,t)}.
    1. For any gameΓ{\displaystyle \Gamma } withn{\displaystyle n} players andt{\displaystyle t} stages,sS{\displaystyle s^{*}\in S} is perfectly self-enforcing if, for allJ{\displaystyle J} inJ{\displaystyle \mathbf {J} } (set of all coalitions),sJ{\displaystyle s_{J}^{*}} is a Perfectly Coalition-Proof Nash equilibrium in the gameΓ/sJ{\displaystyle \Gamma /s_{-J}^{*}}, and if the restriction ofs{\displaystyle s^{*}} to any proper subgame forms a Perfectly Coalition-Proof Nash equilibrium in thatsubgame.
    2. For any gameΓ{\displaystyle \Gamma } withn{\displaystyle n} players andt{\displaystyle t} stages,sS{\displaystyle s^{*}\in S} is a Perfectly Coalition-Proof Nash equilibrium if it is perfectly self-enforcing, and if there does not exist another perfectly self-enforcing strategy vectors{\displaystyle s} inS{\displaystyle S} such thatg1(s)>g1(s){\displaystyle g^{1}(s)>g^{1}(s^{*})} for alli=1,,n{\displaystyle i=1,\dots ,n}.

The coalition-proof Nash equilibrium refines theNash equilibrium by adopting a stronger notion of self-enforceability that allows multilateral deviations.

Parallel to the idea ofcorrelated equilibrium as an extension to Nash equilibrium when public signalling device is allowed, coalition-proof equilibrium is defined by Diego Moreno and John Wooders.[2]

References

[edit]
  1. ^abcdB. D. Bernheim; B. Peleg; M. D. Whinston (1987)."Coalition-Proof Nash Equilibria I. Concepts".Journal of Economic Theory.42:1–12.doi:10.1016/0022-0531(87)90099-8.
  2. ^Diego Moreno; John Wooders (1996),"Coalition-Proof Equilibrium"(PDF),Games and Economic Behavior,17:82–112,doi:10.1006/game.1996.0095,hdl:10016/4408.
Theoretical
Empirical
Applied
Lists
Traditionalgame theory
Definitions
Equilibrium
concepts
Strategies
Games
Theorems
Subfields
Key people
Core
concepts
Games
Mathematical
tools
Search
algorithms
Key people
Core
concepts
Games
Applications
Key people
Core
concepts
Theorems
Applications
Other topics
Retrieved from "https://en.wikipedia.org/w/index.php?title=Coalition-proof_Nash_equilibrium&oldid=1266108712"
Category:
Hidden category:

[8]ページ先頭

©2009-2025 Movatter.jp