Equivalence of consistency and bilateral consistency through converse consistency

Share/Save/Bookmark

Driessen, T.S.H. and Hu, C.-C. (2006) Equivalence of consistency and bilateral consistency through converse consistency. [Report]

[img]
Preview
PDF
243Kb
Abstract:In the framework of (set-valued or single-valued) solutions for coalitional games with transferable utility, the three notions of consistency, bilateral consistency, and converse consistency are frequently used to provide axiomatic characterizations of a particular solution (like the core, prekernel, prenucleolus, Shapley value, and EANSC-value). Our main equivalence theorem claims that a solution satisfies consistency (with respect to an arbitrary reduced game) if and only if the solution satisfies both bilateral consistency and converse consistency (with respect to the same reduced game). The equivalence theorem presumes transitivity of the reduced game technique as well as difference independence on payoff vectors for two-person reduced games. Moulin's complement reduced game, Davis and Maschler's maximum reduced game and Yanovskaya and Driessen's linear reduced game versions are evaluated.

Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66579
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 237575