An Extension of a Class of Cost Sharing Methods to the Solutions of the Class of Two-Person Cooperative Games
Elena Yanovskaya
HSE Working papers from National Research University Higher School of Economics
Abstract:
Two-person games and cost/surplus sharing problems are worth for studying because they are the base for their extending to the classes of such problems with variable population with the help of very powerful consistency properties. In the paper a family of cost-sharing methods for cost sharing problems with two agents [Moulin 2000] is extended to a class of solutions for two-person cooperative games that are larger than both cost-sharing and surplus-sharing problems, since cooperative games have no no restrictions on positivity of costs and surpluses. The tool of the extension is a new invariance axiom -- self covariance -- that can be applied both to cost-sharing methods and to cooperative game solutions. In particular, this axiom replaces the Lower composition axiom not applicable to methods for profit sharing problems
Keywords: cooperative game with transferable utilities; cost/surplus sharing method; self-covariance; solution (search for similar items in EconPapers)
JEL-codes: C71 (search for similar items in EconPapers)
Pages: 23 pages
Date: 2016
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:
Published in WP BRP Series: Economics / EC, March 2016, pages 1-23
Downloads: (external link)
https://www.hse.ru/data/2016/03/21/1128192791/127EC2016.pdf (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:hig:wpaper:127/ec/2016
Access Statistics for this paper
More papers in HSE Working papers from National Research University Higher School of Economics
Bibliographic data for series maintained by Shamil Abdulaev () and Shamil Abdulaev ().