NDLI: Average tree solutions and the distribution of Harsanyi dividends

Content Provider	Springer Nature Link
Author	Baron, Richard Béal, Sylvain Rémila, Eric Solal, Philippe
Copyright Year	2010
Abstract	We consider communication situations games being the combination of a TU-game and a communication graph. We study the average tree (AT) solutions introduced by Herings et al. (Games Econ Behav 62:77–92, 2008; Games Econ Behav 68:626–633, 2010). The AT solutions are defined with respect to a set, say $${\fancyscript{T}}$$ , of rooted spanning trees of the communication graph. We prove the following results. Firstly, the AT solution with respect to $${\fancyscript{T}}$$ is a Harsanyi solution if and only if $${\fancyscript{T}}$$ is a subset of the set of trees introduced in Herings et al. (2010). Secondly, the latter set is constructed by the classical DFS algorithm and the associated AT solution coincides with the Shapley value when the communication graph is complete. Thirdly, the AT solution with respect to trees constructed by the other classical algorithm BFS yields the equal surplus division when the communication graph is complete.
Starting Page	331
Ending Page	349
Page Count	19
File Format	PDF
ISSN	00207276
Journal	International Journal of Game Theory
Volume Number	40
Issue Number	2
e-ISSN	14321270
Language	English
Publisher	Springer-Verlag
Publisher Date	2010-07-04
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Communication situations Average tree solutions Harsanyi solutions DFS BFS Shapley value Equal surplus division Game Theory, Economics, Social and Behav. Sciences Operations Research/Decision Theory Organization/Planning Economic Theory
Content Type	Text
Resource Type	Article
Subject	Statistics and Probability Social Sciences Economics and Econometrics Statistics, Probability and Uncertainty

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Compensations in the Shapley value and the compensation solutions for graph games

Constrained core solutions for totally positive games with ordered players

A characterization of the average tree solution for tree games

Harsanyi power solutions for graph-restricted games

Multi-stage sequencing situations

The optimistic TU game in minimum cost spanning tree problems

Axioms of invariance for TU-games

Dividends and weighted values in games with externalities

Some non-superadditive games, and their Shapley values, in the Talmud

Average tree solutions and the distribution of Harsanyi dividends

Similar Documents

Compensations in the Shapley value and the compensation solutions for graph games

Constrained core solutions for totally positive games with ordered players

A characterization of the average tree solution for tree games

Harsanyi power solutions for graph-restricted games

Multi-stage sequencing situations

The optimistic TU game in minimum cost spanning tree problems

Axioms of invariance for TU-games

Dividends and weighted values in games with externalities

Some non-superadditive games, and their Shapley values, in the Talmud

Average tree solutions and the distribution of Harsanyi dividends