EconPapers    
Economics at your fingertips  
 

A Model of Myerson-Nash Equilibria in Networks

Paolo Pin

A chapter in Artificial Economics, 2006, pp 175-188 from Springer

Abstract: Summary The paper studies network formation in undirected graphs. We assume a two-stage game: agents propose connections that if realized have a fixed cost; then, given the obtained graph and its exogenous surplus (the value function), they bargain on the split. We claim that, when the surplus from connections is super-additive, the bargaining process can be solved with the Myerson Value allocation rule, an adaptation of Shapley’s to graphs. This will lead to an (only theoretically, not in computations) easy characterisation of equilibria, refining the notion of pairwise stability. We then focus our attention on the heuristical analysis of a tractable case. We run simulations, starting from different initial conditions, in order to qualitatively characterize alternative possible equilibria. For part of this last purpose we are using the simulated annealing approach, with theoretical justification for its adoption.

Keywords: Nash Equilibrium; Simulated Annealing; Preferential Attachment; Allocation Rule; Stochastic Stability (search for similar items in EconPapers)
Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-540-28547-2_15

Ordering information: This item can be ordered from
http://www.springer.com/9783540285472

DOI: 10.1007/3-540-28547-4_15

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).

 
Page updated 2025-04-01
Handle: RePEc:spr:lnechp:978-3-540-28547-2_15