Game Representations and Extensions of the Shapley Value
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Pradeep Dubey, 2018.
"Intuitive Solutions in Game Representations: The Shapley Value Revisited,"
Cowles Foundation Discussion Papers
2123, Cowles Foundation for Research in Economics, Yale University.
- Pradeep Dubey, 2018. "Intuitive Solutions in Game Representations: The Shapley Value Revisited," Department of Economics Working Papers 18-01, Stony Brook University, Department of Economics.
- Roger B. Myerson, 1977.
"Graphs and Cooperation in Games,"
Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
- Roger B. Myerson, 1976. "Graphs and Cooperation in Games," Discussion Papers 246, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Pradeep Dubey, 1982. "The Shapley Value as Aircraft Landing Fees--Revisited," Management Science, INFORMS, vol. 28(8), pages 869-874, August.
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.- Pradeep Dubey, 2024. "Equitable Solutions in Game Representations: An Extension of the Shapley Value," Department of Economics Working Papers 24-01, Stony Brook University, Department of Economics.
- Stefano Moretti & Fioravante Patrone, 2008. "Transversality of the Shapley value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 1-41, July.
- Pradeep Dubey, 2018. "Equitable Solutions in Game Representations and the Shapley Value," Department of Economics Working Papers 18-11, Stony Brook University, Department of Economics.
- Miklós Pintér & Anna Radványi, 2013. "The Shapley value for shortest path games: a non-graph-based approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(4), pages 769-781, December.
- Guang Zhang & Erfang Shan & Liying Kang & Yanxia Dong, 2017. "Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 462-482, August.
- Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022.
"Early contributors, cooperation and fair rewards in crowdfunding,"
Working Papers
hal-04222321, HAL.
- Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers 2022-07, CRESE.
- 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.
- Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
- Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024.
"Cooperative games with diversity constraints,"
Working Papers
hal-04447373, HAL.
- Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers 2024-06, CRESE.
- Rodrigo J. Harrison & Roberto Munoz, 2003. "Stability and Equilibrium Selection in a Link Formation Game," Game Theory and Information 0306004, University Library of Munich, Germany.
- Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2016.
"Network Economics and the Environment: Insights and Perspectives,"
Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 65(1), pages 159-189, September.
- Sergio Currarini & Carmen Marchiori & Alessandro Tavoni, 2014. "Network economics and the environment: insights and perspectives," GRI Working Papers 145, Grantham Research Institute on Climate Change and the Environment.
- Currarini, Sergio & Marchiori, Carmen & Tavoni, Alessandro, 2016. "Network economics and the environment: insights and perspectives," LSE Research Online Documents on Economics 63951, London School of Economics and Political Science, LSE Library.
- Currarini, Sergio & Marchiori, Carmen & Tavoni, Alessandro, 2014. "Network Economics and the Environment: Insights and Perspectives," Climate Change and Sustainable Development 163615, Fondazione Eni Enrico Mattei (FEEM).
- Youngsub Chun & Boram Park, 2016. "The airport problem with capacity constraints," Review of Economic Design, Springer;Society for Economic Design, vol. 20(3), pages 237-253, September.
- Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015.
"The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations,"
Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
- Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2014. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Working Papers halshs-01098766, HAL.
- Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Post-Print halshs-01212167, HAL.
- Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2014. "The Sequential Equal Surplus Division for Rooted Forest Games and an Application to Sharing a River with Bifurcations," Working Papers 1440, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
- Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015.
"Allocation rules for coalitional network games,"
Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
- CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2013. "Allocation rules for coalitional network games," LIDAM Discussion Papers CORE 2013032, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- CAULIER, Jean-François & MAULEON, Ana & VANNETELBOSCH, Vincent, 2015. "Allocation rules for coalitional network games," LIDAM Reprints CORE 2718, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2015. "Allocation rules for coalitional network games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01301981, HAL.
- Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2015. "Allocation rules for coalitional network games," Post-Print hal-01301981, HAL.
- H. Andrew Michener & Daniel J. Myers, 1998. "Probabilistic Coalition Structure Theories," Journal of Conflict Resolution, Peace Science Society (International), vol. 42(6), pages 830-860, December.
- van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013.
"A strategic implementation of the Average Tree solution for cycle-free graph games,"
Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
- Rene van den Brink & Gerard van der Laan & Nigel Moes, 2012. "A Strategic Implementation of the Average Tree Solution for Cycle-Free Graph Games," Tinbergen Institute Discussion Papers 12-050/1, Tinbergen Institute.
- Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
- László Á. Kóczy, 2016.
"Power Indices When Players can Commit to Reject Coalitions,"
Homo Oeconomicus: Journal of Behavioral and Institutional Economics, Springer, vol. 33(1), pages 77-91, August.
- László Á. Kóczy, 2013. "Power indices when players can commit to reject coalitions," Working Paper Series 1401, Óbuda University, Keleti Faculty of Business and Management.
- László Á. Kóczy, 2014. "Power indices when players can commit to reject coalitions," CERS-IE WORKING PAPERS 1431, Institute of Economics, Centre for Economic and Regional Studies.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2015.
"Discounted Tree Solutions,"
Working Papers
hal-01377923, HAL.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "Discounted Tree Solutions," Post-Print halshs-01413007, HAL.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2016. "Discounted Tree Solutions," Post-Print halshs-01413033, HAL.
- Sylvain Béal & Eric Rémila & Philippe Solal, 2016. "Discounted Tree Solutions," Post-Print halshs-01413021, HAL.
- Sylvain Béal & Eric Rémila & Phillippe Solal, 2015. "Discounted Tree Solutions," Working Papers 2015-18, CRESE.
- Joost Vandenbossche & Thomas Demuynck, 2013.
"Network Formation with Heterogeneous Agents and Absolute Friction,"
Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
- J. Vandenbossche & T. Demuynck & -, 2010. "Network formation with heterogeneous agents and absolute friction," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 10/642, Ghent University, Faculty of Economics and Business Administration.
- Thomas Demuynck & Joost Vandenbossche, 2013. "Network formation with heterogeneous agents and absolute friction," ULB Institutional Repository 2013/252237, ULB -- Universite Libre de Bruxelles.
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:arx:papers:2401.09845. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.