Trading in Networks: A Normal Form Game Experiment

2009 ◽  
Vol 1 (2) ◽  
pp. 114-132 ◽  
Author(s):  
Douglas M Gale ◽  
Shachar Kariv

This paper reports an experimental study of trading networks. Networks are incomplete in the sense that each trader can only exchange assets with a limited number of other traders. The greater the incompleteness of the network, the more intermediation is required to transfer the assets between initial and final owners. The uncertainty of trade in networks constitutes a potentially important market friction. Nevertheless, we find the pricing behavior observed in the laboratory converges to competitive equilibrium behavior in a variety of treatments. However, the rate of convergence varies depending on the network, pricing rule, and payoff function. (JEL C91, C92, G10, G19)

2003 ◽  
Vol 112 ◽  
pp. 765-768 ◽  
Author(s):  
Y. Bellouard ◽  
R. Clavel ◽  
R. Gotthardt ◽  
J. van Humbeeck

2010 ◽  
Vol 389 (3) ◽  
pp. 481-489 ◽  
Author(s):  
Serge Galam ◽  
Bernard Walliser

2013 ◽  
Vol 121 (5) ◽  
pp. 966-1005 ◽  
Author(s):  
John William Hatfield ◽  
Scott Duke Kominers ◽  
Alexandru Nichifor ◽  
Michael Ostrovsky ◽  
Alexander Westkamp

Games ◽  
2013 ◽  
Vol 4 (3) ◽  
pp. 398-425 ◽  
Author(s):  
Torsten Heinrich ◽  
Henning Schwardt

2019 ◽  
Vol 21 (02) ◽  
pp. 1940011
Author(s):  
Thomas A. Weber

To quantify a player’s commitment in a given Nash equilibrium of a finite dynamic game, we map the corresponding normal-form game to a “canonical extension,” which allows each player to adjust his or her move with a certain probability. The commitment measure relates to the average overall adjustment probabilities for which the given Nash equilibrium can be implemented as a subgame-perfect equilibrium in the canonical extension.


Games ◽  
2013 ◽  
Vol 4 (4) ◽  
pp. 776-794 ◽  
Author(s):  
Sibilla Di Guida ◽  
Giovanna Devetag

2010 ◽  
Vol 12 (03) ◽  
pp. 253-261
Author(s):  
RYUSUKE SHINOHARA

The relationship between coalition-proof (Nash) equilibria in a normal-form game and those in its subgame is examined. A subgame of a normal-form game is a game in which the strategy sets of all players in the subgame are subsets of those in the normal-form game. In this paper, focusing on a class of aggregative games, we provide a sufficient condition for the aggregative game under which every coalition-proof equilibrium in a subgame is also coalition-proof in the original normal-form game. The stringency of the sufficient condition means that a coalition-proof equilibrium in a subgame is rarely a coalition-proof equilibrium in the whole game.


Sign in / Sign up

Export Citation Format

Share Document