Misplaced Pages

Coalition-proof Nash equilibrium

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Coalition-proof Nash equilibrium
Solution concept in game theory
Relationship
Subset ofNash Equilibrium
Superset ofStrong Nash equilibrium
Significance

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

The Strong Nash equilibrium is criticized as too "strong" in that the environment allows for unlimited private communication. In the coalition-proof Nash equilibrium the private communication is limited.

Definition

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. In a single player, single stage game Γ {\displaystyle \Gamma } , s S {\displaystyle s^{\ast }\in S} is a Perfectly Coalition-Proof Nash equilibrium if and only if s {\displaystyle s^{\ast }} maximizes g 1 ( 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 with m {\displaystyle m} players and s {\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 } with n {\displaystyle n} players and t {\displaystyle t} stages, s S {\displaystyle s^{*}\in S} is perfectly self-enforcing if, for all J {\displaystyle J} in J {\displaystyle \mathbf {J} } (set of all coalitions), s J {\displaystyle s_{J}^{*}} is a Perfectly Coalition-Proof Nash equilibrium in the game Γ / s J {\displaystyle \Gamma /s_{-J}^{*}} , and if the restriction of s {\displaystyle s^{*}} to any proper subgame forms a Perfectly Coalition-Proof Nash equilibrium in that subgame.
    2. For any game Γ {\displaystyle \Gamma } with n {\displaystyle n} players and t {\displaystyle t} stages, s S {\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 vector s {\displaystyle s} in S {\displaystyle S} such that g 1 ( s ) > g 1 ( s ) {\displaystyle g^{1}(s)>g^{1}(s^{*})} for all i = 1 , , n {\displaystyle i=1,\dots ,n} .

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

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

References

  1. ^ B. 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.
Economics
Theoretical
Empirical
Applied
Schools
(history)
Economists
Lists
  • Category
  • Index
  • Lists
  • Outline
  • Publications
  • Business portal
  • Topics of game theory
    Definitions
    Equilibrium
    concepts
    Strategies
    Classes
    of games
    Games
    Theorems
    Key
    figures
    Search optimizations
    Miscellaneous
    Category: