Advanced Search
MyIDEAS: Login

ANC Analytical Payoff Functions for Networks with Endogenous Bilateral Long Cheap Talk


Author Info

  • Ricardo Nieva


We derive an almost non cooperative (ANC) analytical payoff function for all three-agent Aumann-Myerson (1988) games, and tractable ones exist for all three-agent A-M-like network games with any fixed valuation, in contrast to restricted results in the literature, if at all. Unlike link proposal game A-M and Myerson (1986), ANC has dynamic bilateral cooperation as we assume bilateral long cheap talk among three agents (differing from A-Hart (2003)), i.e., (1) pairs "smooth" Nash bargain during link discussions over credible expected payoffs induced by equilibria of a Nash demand-like game-where a link forms if the two agents match (2) double proposals, i.e., payoffs that sum up to their Myerson values in the prospective graph, and future bilateral coordination schemes. Thus, payoffs in the final graph of ANC yield a "variable Myerson value pair" which accounts for future possibilities of link formation. Instead, A-M has (a) "fixed" Myerson values (1977). In ANC, key (b) multiple equilibria in A-M-with conflicting requests of two agents to an indifferent third one-are solved, as coordination on requests by earlier linked pairs prevails if credible. This follows from (3) almost assuming that schemes are reminded chronologically "behind closed doors" as there is almost a natural first-mover advantage. (c) Inefficiency is possible in A-M, but not in ANC. We state some of the complete analytics for A-M. Also, in strictly superadditive games, only two-link graphs form. If only a link-coalition of two-forms then they achieve the grand coalition's worth

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL:
Our checks indicate that this address may not be valid because: 403 Forbidden. If this is indeed the case, please notify (Christopher F. Baum)
File Function: main text
Download Restriction: no

Bibliographic Info

Paper provided by Econometric Society in its series Econometric Society 2004 North American Summer Meetings with number 547.

as in new window
Date of creation: 11 Aug 2004
Date of revision:
Handle: RePEc:ecm:nasm04:547

Contact details of provider:
Phone: 1 212 998 3820
Fax: 1 212 995 4487
Web page:
More information through EDIRC

Related research

Keywords: Sequential Networks; Dynamic Nash Bargaining; Tractable Analytical payoff functions; 3-agent; Endogenous Coalition Structures; All Payoff allocation rules; All Fixed Valuation functions; Endogenous Long cheap talk; Almost Non-cooperative;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:


No references listed on IDEAS
You can help add them by filling out this form.



This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


Access and download statistics


When requesting a correction, please mention this item's handle: RePEc:ecm:nasm04:547. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.