New allocation rule of directed hypergraphs
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Sylvain Béal & André Casajus & Frank Huettner, 2015.
"Efficient extensions of the Myerson value,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(4), pages 819-827, December.
- Sylvain Béal & André Casajus & Frank Huettner, 2015. "Efficient extension of the Myerson value," Working Papers hal-01376904, HAL.
- Sylvain Béal & André Casajus & Frank Huettner, 2015. "Efficient extensions of the Myerson value," Working Papers 2015-01, CRESE.
- van den Nouweland, Anne & Borm, Peter & Tijs, Stef, 1992.
"Allocation Rules for Hypergraph Communication Situations,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 20(3), pages 255-268.
- van den Nouweland, C.G.A.M. & Borm, P.E.M. & Tijs, S.H., 1992. "Allocation rules for hypergraph communication situations," Other publications TiSEM d662c517-fdc1-45ef-8908-6, Tilburg University, School of Economics and Management.
- van den Nouweland, C.G.A.M. & Borm, P.E.M. & Tijs, S.H., 1992. "Allocation rules for hypergraph communication situations," Other publications TiSEM b97fb9dd-2acf-470d-b9eb-a, Tilburg University, School of Economics and Management.
- González–Arangüena, Enrique & Manuel, Conrado Miguel & del Pozo, Mónica, 2015. "Values of games with weighted graphs," European Journal of Operational Research, Elsevier, vol. 243(1), pages 248-257.
- Neyman, Abraham, 1989.
"Uniqueness of the Shapley value,"
Games and Economic Behavior, Elsevier, vol. 1(1), pages 116-118, March.
- NEYMAN, Abraham, 1988. "Uniqueness of the Shapley value," LIDAM Discussion Papers CORE 1988013, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- 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.
- D. Gómez & E. González-Arangüena & C. Manuel & G. Owen & M. del Pozo & J. Tejada, 2004. "Splitting graphs when calculating Myerson value for pure overhead games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 479-489, July.
- E. Algaba & J. M. Bilbao & P. Borm & J. J. López, 2001. "The Myerson value for union stable structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(3), pages 359-371, December.
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.- González–Arangüena, E. & Manuel, C. & Owen, G. & del Pozo, M., 2017. "The within groups and the between groups Myerson values," European Journal of Operational Research, Elsevier, vol. 257(2), pages 586-600.
- 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.
- Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021.
"The average tree value for hypergraph games,"
Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, A.J.J. & Zhang, Guang, 2020. "The Average Tree value for Hypergraph Games," Discussion Paper 2020-005, Tilburg University, Center for Economic Research.
- Schouten, Jop & Dietzenbacher, Bas & Borm, Peter, 2019.
"The Nucleolus and Inheritance of Properties in Communication Situations,"
Other publications TiSEM
bacc7f47-9b6b-4ce4-9f97-4, Tilburg University, School of Economics and Management.
- Schouten, Jop & Dietzenbacher, Bas & Borm, Peter, 2019. "The Nucleolus and Inheritance of Properties in Communication Situations," Discussion Paper 2019-008, Tilburg University, Center for Economic Research.
- Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023.
"The two-step average tree value for graph and hypergraph games,"
Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, A.J.J. & Zhang, Guang, 2020. "The Two-Step Average Tree Value for Graph and Hypergraph Games," Discussion Paper 2020-018, Tilburg University, Center for Economic Research.
- E. Algaba & J. Bilbao & R. Brink, 2015.
"Harsanyi power solutions for games on union stable systems,"
Annals of Operations Research, Springer, vol. 225(1), pages 27-44, February.
- Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink, 2011. "Harsanyi Power Solutions for Games on Union Stable Systems," Tinbergen Institute Discussion Papers 11-182/1, Tinbergen Institute.
- Bas Dietzenbacher & Peter Borm & Ruud Hendrickx, 2017.
"Decomposition of network communication games,"
Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(3), pages 407-423, June.
- Dietzenbacher, Bas & Borm, Peter & Hendrickx, Ruud, 2015. "Decomposition of Network Communication Games," Discussion Paper 2015-057, Tilburg University, Center for Economic Research.
- Dietzenbacher, Bas & Borm, Peter & Hendrickx, Ruud, 2017. "Decomposition of network communication games," Other publications TiSEM ab795ba7-d302-44bf-ba6a-f, Tilburg University, School of Economics and Management.
- Dietzenbacher, Bas & Borm, Peter & Hendrickx, Ruud, 2015. "Decomposition of Network Communication Games," Other publications TiSEM c07a09b0-0bd7-4533-ac99-3, Tilburg University, School of Economics and Management.
- Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021.
"The average tree value for hypergraph games,"
Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, A.J.J. & Zhang, Guang, 2020. "The Average Tree value for Hypergraph Games," Discussion Paper 2020-005, Tilburg University, Center for Economic Research.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, A.J.J. & Zhang, Guang, 2020. "The Average Tree value for Hypergraph Games," Other publications TiSEM 331f101b-09ee-47d6-afdf-e, Tilburg University, School of Economics and Management.
- Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2023.
"The two-step average tree value for graph and hypergraph games,"
Annals of Operations Research, Springer, vol. 323(1), pages 109-129, April.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, A.J.J. & Zhang, Guang, 2020. "The Two-Step Average Tree Value for Graph and Hypergraph Games," Discussion Paper 2020-018, Tilburg University, Center for Economic Research.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, A.J.J. & Zhang, Guang, 2020. "The Two-Step Average Tree Value for Graph and Hypergraph Games," Other publications TiSEM 54b390b3-2713-4a64-874c-8, Tilburg University, School of Economics and Management.
- Kang, Liying & Khmelnitskaya, Anna & Shan, Erfang & Talman, Dolf & Zhang, Guang, 2023. "The two-step average tree value for graph and hypergraph games," Other publications TiSEM 8a5590f3-8b70-4202-95d9-2, Tilburg University, School of Economics and Management.
- Takashi Ui & Hiroyuki Kojima & Atsushi Kajii, 2011. "The Myerson value for complete coalition structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 427-443, December.
- J. Schouten & B. Dietzenbacher & P. Borm, 2022. "The nucleolus and inheritance of properties in communication situations," Annals of Operations Research, Springer, vol. 318(2), pages 1117-1135, November.
- Erfang Shan & Guang Zhang & Xiaokang Shan, 2018. "The degree value for games with communication structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 857-871, September.
- 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.
- Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.
- Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
- Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink & Jorge J. Lopez, 2011. "The Myerson Value and Superfluous Supports in Union Stable Systems," Tinbergen Institute Discussion Papers 11-127/1, Tinbergen Institute.
- E. Algaba & J. M. Bilbao & R. Brink & J. J. López, 2012. "The Myerson Value and Superfluous Supports in Union Stable Systems," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 650-668, November.
- 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," Post-Print halshs-00881125, HAL.
- 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," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01207823, HAL.
- 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, 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, 2015. "An allocation rule for dynamic random network formation processes," Post-Print halshs-01207823, HAL.
- 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.
- 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.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-GTH-2021-10-18 (Game Theory)
- NEP-NET-2021-10-18 (Network Economics)
Statistics
Access and download statisticsCorrections
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:2110.06506. 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.