Outside option values for network games
Author
Abstract
Suggested Citation
DOI: 10.1016/j.mathsocsci.2016.09.005
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Marco Slikker, 2005. "A characterization of the position value," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 505-514, November.
- Jackson, Matthew O., 2005.
"Allocation rules for network games,"
Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Game Theory and Information 0303010, University Library of Munich, Germany.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Working Papers 1160, California Institute of Technology, Division of the Humanities and Social Sciences.
- Matthew O. Jackson, 2003. "Allocation Rules for Network Games," Working Papers 2003.51, Fondazione Eni Enrico Mattei.
- Jackson, Matthew O. & Wolinsky, Asher, 1996.
"A Strategic Model of Social and Economic Networks,"
Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
- Matthew O. Jackson & Asher Wolinsky, 1994. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson & Asher Wolinsky, 1995. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- René Brink & Gerard Laan & Vitaly Pruzhansky, 2011.
"Harsanyi power solutions for graph-restricted games,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 87-110, February.
- René van den Brink & Gerard van der Laan & Vitaly Pruzhansky, 2004. "Harsanyi Power Solutions for Graph-restricted Games," Tinbergen Institute Discussion Papers 04-095/1, Tinbergen Institute.
- van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
- André Casajus, 2009. "Networks and outside options," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(1), pages 1-13, January.
- Julia Belau, 2011.
"Outside Options In Probabilistic Coalition Situations,"
International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 13(04), pages 417-442.
- Belau, Julia, 2011. "Outside Options in Probabilistic Coalition Situations," Ruhr Economic Papers 236, RWI - Leibniz-Institut für Wirtschaftsforschung, Ruhr-University Bochum, TU Dortmund University, University of Duisburg-Essen.
- Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
- Nash, John, 1950. "The Bargaining Problem," Econometrica, Econometric Society, vol. 18(2), pages 155-162, April.
- Marco Slikker, 2005.
"Link Monotonic Allocation Schemes,"
International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
- Slikker, M., 1999. "Link Monotonic Allocation Schemes," Discussion Paper 1999-06, Tilburg University, Center for Economic Research.
- Navarro, Noemi, 2007. "Fair allocation in networks with externalities," Games and Economic Behavior, Elsevier, vol. 58(2), pages 354-364, February.
- repec:zbw:rwirep:0236 is not listed on IDEAS
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
- Daniel Li Li & Erfang Shan, 2022. "Safety of links with respect to the Myerson value for communication situations," Operational Research, Springer, vol. 22(3), pages 2121-2131, July.
- Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
- Daniel Li Li & Erfang Shan, 2021. "Cooperative games with partial information," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 297-309, March.
- Julia Belau, 2018. "The class of ASN-position values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 50(1), pages 65-99, January.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
- Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
- Borkotokey, Surajit & Kumar, Rajnish & Sarangi, Sudipta, 2015. "A solution concept for network games: The role of multilateral interactions," European Journal of Operational Research, Elsevier, vol. 243(3), pages 912-920.
- Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.
- Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021.
"Probabilistic network values,"
Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
- Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2020. "Probabilistic Network Values," QBS Working Paper Series 2020/08, Queen's University Belfast, Queen's Business School.
- Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
- Borkotokey, Surajit & Sarangi, Sudipta, 2011. "Allocation rules for fixed and flexible networks: the role of players and their links," MPRA Paper 38340, University Library of Munich, Germany.
- C. Manuel & D. Martín, 2021. "A value for communication situations with players having different bargaining abilities," Annals of Operations Research, Springer, vol. 301(1), pages 161-182, June.
- Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers Dissertations 01, Paderborn University, Faculty of Business Administration and Economics.
- Julia Belau, 2012. "A New Outside Option Value for Networks: The Kappa-Value – Measuring Distribution of Power of Political Agreements," Ruhr Economic Papers 0326, Rheinisch-Westfälisches Institut für Wirtschaftsforschung, Ruhr-Universität Bochum, Universität Dortmund, Universität Duisburg-Essen.
- Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.
- van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
- repec:zbw:rwirep:0326 is not listed on IDEAS
- Julia Belau, 2013. "An outside-option-sensitive allocation rule for networks: the kappa-value," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 1(2), pages 175-188, November.
- Li, Daniel Li & Shan, Erfang, 2019. "The position value and the structures of graphs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 190-197.
- Surajit Borkotokey & Loyimee Gogoi & Sudipta Sarangi, 2014. "A Survey of Player-based and Link-based Allocation Rules for Network Games," Studies in Microeconomics, , vol. 2(1), pages 5-26, June.
- Belau, Julia, 2012. "A New Outside Option Value for Networks: The Kappa-Value – Measuring Distribution of Power of Political Agreements," Ruhr Economic Papers 326, RWI - Leibniz-Institut für Wirtschaftsforschung, Ruhr-University Bochum, TU Dortmund University, University of Duisburg-Essen.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015.
"An allocation rule for dynamic random network formation processes,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Documents de travail du Centre d'Economie de la Sorbonne 13063, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00881125, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," PSE-Ecole d'économie de Paris (Postprint) halshs-01207823, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Post-Print halshs-00881125, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01207823, HAL.
- Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Post-Print halshs-01207823, HAL.
- Suzuki, T. & Talman, A.J.J., 2011.
"Solution Concepts for Cooperative Games with Circular Communication Structure,"
Discussion Paper
2011-100, Tilburg University, Center for Economic Research.
- Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
- Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008.
"The average tree solution for cycle-free graph games,"
Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
- Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2008. "The average tree solution for cycle-free graph games," Other publications TiSEM f243609c-2847-415f-ae52-1, Tilburg University, School of Economics and Management.
- HERINGS, P. Jean-Jacques & van der LAAN, Gerard & TALMAN, Dolf, 2009. "The average tree solution for cycle-free graph games," LIDAM Reprints CORE 2155, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:84:y:2016:i:c:p:76-86. See general information about how to correct material in RePEc.
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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.