Graphs and (levels of) cooperation in games: two ways how to allocate the surplus

DOI10.1016/j.mathsocsci.2018.02.005zbMath1393.91007OpenAlexW2793000682WikidataQ130120130 ScholiaQ130120130MaRDI QIDQ1642169

M. Álvarez-Mozos, Oriol Tejada

Publication date: 20 June 2018

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2445/121286

zbMATH Keywords

Shapley valueresource allocationBanzhaf valuecommunication graphsurplus allocationcooperation levels in gamesgraphs in games

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

The Shapley value for cooperative games with restricted worths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Values of games with graph restricted communication and a priori unions
• Configuration values: Extensions of the coalitional Owen value
• Monotonic solutions of cooperative games
• An axiomatization of the Banzhaf value
• A value for cooperative games with levels structure of cooperation
• Conference structures and fair allocation rules
• Cooperative games with coalition structures
• Collusion properties of values
• On an axiomatization of the Banzhaf value without the additivity axiom
• Modification of the Banzhaf value for games with a coalition structure
• The modified Banzhaf value for games with coalition structure: An axiomatic characterization.
• Alternative axiomatic characterizations of the Shapley and Banzhaf values
• The Owen value applied to games with graph-restricted communication
• Coalition configurations and share functions
• Coalition configurations and the Banzhaf index
• Values of Graph-Restricted Games
• Graphs and Cooperation in Games
• The Banzhaf value and communication situations

This page was built for publication: Graphs and (levels of) cooperation in games: two ways how to allocate the surplus