LINK MONOTONIC ALLOCATION SCHEMES

DOI10.1142/S021919890500065XzbMath1151.91377OpenAlexW2109036329MaRDI QIDQ5716145

Marco Slikker

Publication date: 9 January 2006

Published in: International Game Theory Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021919890500065x

zbMATH Keywords

networkmonotonic allocation schemereward game

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (13)

Power surplus solutions for weighted hypergraph communication situations ⋮ A probabilistic position value ⋮ The class of ASN-position values. Centrality and consequences of connection failure ⋮ Graph monotonic values ⋮ Outside option values for network games ⋮ The Banzhaf value for generalized probabilistic communication situations ⋮ Bidding for surplus in network allocation problems ⋮ Monotonicity of power in weighted voting games with restricted communication ⋮ An axiomatic characterization of the position value for network situations ⋮ On the Position Value for Special Classes of Networks ⋮ An allocation rule for dynamic random network formation processes ⋮ On the population monotonicity of independent set games ⋮ A Simple Bargaining Procedure for the Myerson Value

Cites Work

• Incomplete stable structures in symmetric convex games
• Population monotonic allocation schemes for cooperative games with transferable utility
• Stable networks
• Cores of convex games
• A strategic model of social and economic networks
• Potential, Value, and Consistency
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games
• INFORMATION SHARING GAMES
• A dynamic model of network formation

This page was built for publication: LINK MONOTONIC ALLOCATION SCHEMES