title   
  

One-memory in multiperson bargaining

Okbay, Aysu (2012) One-memory in multiperson bargaining. [Thesis]

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
372Kb

Official URL: http://192.168.1.20/record=b1505251 (Table of Contents)

Abstract

In Rubinstein's (1982) 2-player discounted alternating offers bargaining game, the subgame perfect equilibrium outcome is unique and equivalent to the Nash bargaining solution. However, when there are more than 2 players, every feasible partition can be sustained in subgame perfect equilibrium with a sufficiently high discount factor (Shaked 1986). We prove that when the restriction to one-memory strategies is employed in the multiplayer version of the game, the subgame perfect equilibrium is unique and equivalent to the multiplayer generalization of Rubinstein's. This also implies that the unique subgame perfect equilibrium outcome corresponds to the Nash solution in the multiplayer cooperative game.

Item Type:Thesis
Uncontrolled Keywords:Bargaining. -- Recall. -- Bounded rationality. -- Complexity. -- Stationarity. -- Pazarlık. -- Hafıza. -- Kısıtlı rasyonellik. -- Karmaşıklık. -- Değişmezlik. -- Sınırlı rasyonalite.
Subjects:H Social Sciences > HB Economic Theory
ID Code:24131
Deposited By:IC-Cataloging
Deposited On:16 Apr 2014 12:25
Last Modified:16 Apr 2014 12:25

Repository Staff Only: item control page