Sharing Rewards in Cooperative Connectivity Games

DOI10.1613/jair.3841zbMath1267.68244arXiv1402.0572OpenAlexW3102468141MaRDI QIDQ4927422

Ely Porat, Yoram Bachrach, Jeffrey S. Rosenschein

Publication date: 20 June 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0572

zbMATH Keywords

selfish agentsBanzhaf power indicesShapley power indicesvertex connectivity game

Mathematics Subject Classification ID

Cooperative games (91A12) Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Agent technology and artificial intelligence (68T42)

Related Items (8)

Proof systems and transformation games ⋮ Dynamic programming for computing power indices for weighted voting games with precoalitions ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ Pooling of critical, low-utilization resources with unavailability ⋮ Game Theory and Cyber Defense ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ Analyzing Power in Weighted Voting Games with Super-Increasing Weights ⋮ Monte Carlo methods for the Shapley-Shubik power index

This page was built for publication: Sharing Rewards in Cooperative Connectivity Games