Advanced Search
MyIDEAS: Login

A strategic implementation of the Average Tree solution for cycle-free graph games

Contents:

Author Info

  • van den Brink, René
  • van der Laan, Gerard
  • Moes, Nigel

Abstract

In this note we provide a strategic implementation of the Average Tree solution for zero-monotonic cycle-free graph games. That is, we propose a non-cooperative mechanism of which the unique subgame perfect equilibrium payoffs correspond to the average hierarchical outcome of the game. This mechanism takes into account that a player is only able to communicate with other players (i.e., to make proposals about a division of the surplus of cooperation) when they are connected in the graph.

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: http://www.sciencedirect.com/science/article/pii/S0022053113001361
Download Restriction: Full text for ScienceDirect subscribers only

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Elsevier in its journal Journal of Economic Theory.

Volume (Year): 148 (2013)
Issue (Month): 6 ()
Pages: 2737-2748

as in new window
Handle: RePEc:eee:jetheo:v:148:y:2013:i:6:p:2737-2748

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869

Related research

Keywords: Implementation; Cycle-free graph game; Hierarchical outcome; Average Tree solution; Weighted hierarchical outcome;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Gabrielle Demange, 2004. "On Group Stability in Hierarchies and Networks," Journal of Political Economy, University of Chicago Press, vol. 112(4), pages 754-778, August.
  2. Inés Macho-Stadler & David Pérez-Castrillo & David Wettstein, 2005. "Efficient Bidding with Externalities," UFAE and IAE Working Papers 641.05, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  3. Ambec, S. & Sprumont, Y., 2000. "Sharing a River," Papers 00-06, Laval - Recherche en Energie.
  4. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
  5. P. Jean-Jacques Herings & Gerard van der Laan & Dolf Talman & Zaifu Yang, 2008. "The Average Tree Solution for Cooperative Games with Communication Structure," Tinbergen Institute Discussion Papers 08-083/1, Tinbergen Institute.
  6. Perez-Castrillo, David & Wettstein, David, 2005. "Forming efficient networks," Economics Letters, Elsevier, vol. 87(1), pages 83-87, April.
  7. HERINGS, P. Jean-Jacques & van der LAAN, Gerard & TALMAN, Dolf, . "The average tree solution for cycle-free graph games," CORE Discussion Papers RP -2155, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  8. David P�rez-Castrillo & David Wettstein, 2002. "Choosing Wisely: A Multibidding Approach," American Economic Review, American Economic Association, vol. 92(5), pages 1577-1587, December.
  9. Vidal-Puga, Juan & Bergantinos, Gustavo, 2003. "An implementation of the Owen value," Games and Economic Behavior, Elsevier, vol. 44(2), pages 412-427, August.
  10. Ju, Y. & Wettstein, D., 2006. "Implementing Cooperative Solution Concepts: A Generalized Bidding Approach," Discussion Paper 2006-42, Tilburg University, Center for Economic Research.
  11. repec:dgr:uvatin:2010065 is not listed on IDEAS
  12. Rene van den Brink & Gerard van der Laan & Nigel Moes, 2010. "Fair Agreements for Sharing International Rivers with Multiple Springs and Externalities," Tinbergen Institute Discussion Papers 10-096/1, Tinbergen Institute.
  13. René Brink & Yukihiko Funaki & Yuan Ju, 2013. "Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values," Social Choice and Welfare, Springer, vol. 40(3), pages 693-714, March.
  14. Mutuswami, Suresh & Perez-Castrillo, David & Wettstein, David, 2004. "Bidding for the surplus: realizing efficient outcomes in economic environments," Games and Economic Behavior, Elsevier, vol. 48(1), pages 111-123, July.
  15. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
  16. Rene van den Brink & Yukihiko Funaki, 2010. "Axiomatization and Implementation of Discounted Shapley Values," Tinbergen Institute Discussion Papers 10-065/1, Tinbergen Institute.
  17. Talman, A.J.J. & Yamamoto, Y., 2008. "Average tree solution and subcore for acyclic graph games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-3129818, Tilburg University.
  18. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Rooted-tree solutions for tree games," European Journal of Operational Research, Elsevier, vol. 203(2), pages 404-408, June.
  19. Maschler, M & Owen, G, 1989. "The Consistent Shapley Value for Hyperplane Games," International Journal of Game Theory, Springer, vol. 18(4), pages 389-407.
  20. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
Full references (including those not matched with items on IDEAS)

Citations

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:148:y:2013:i:6:p:2737-2748. 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: (Zhang, Lei).

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.