Values of games with probabilistic graphs

DOI10.1016/S0165-4896(98)00013-4MaRDI QIDQ1296512zbMATH OpenOpenAlexFDO

Authors Emilio Calvo, Anne van den Nouweland, J. Javier Lasaga

Publication date 2 August 1999

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

Full work available at URL https://doi.org/10.1016/s0165-4896(98)00013-4

zbMATH Keywords

Shapley valueMyerson valueCommunication restrictionsDirect communicationProbabilistic graphs

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Probabilistic games; gambling (91A60)

Recommendations

• A value for generalized probabilistic communication situations
• Probabilistic network values
• scientific article; zbMATH DE number 4162686
• Values of Graph-Restricted Games
• A mean value for games with communication structures

Cites work

• scientific article; zbMATH DE number 4172789 (Why is no real title available?)
• scientific article; zbMATH DE number 3934814 (Why is no real title available?)
• scientific article; zbMATH DE number 3781003 (Why is no real title available?)
• scientific article; zbMATH DE number 3614541 (Why is no real title available?)
• scientific article; zbMATH DE number 1226095 (Why is no real title available?)
• scientific article; zbMATH DE number 970204 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Conference structures and fair allocation rules
• Endogenous Formation of Coalitions
• Graphs and Cooperation in Games
• Multilinear Extensions of Games
• Potential, Value, and Consistency
• The Nucleolus of a Characteristic Function Game
• The Owen value applied to games with graph-restricted communication
• The consistency and potential for values of games with coalition structure

Cited in

(26)

• A value for communication situations with players having different bargaining abilities
• The Banzhaf value for generalized probabilistic communication situations
• The Myerson value for directed graph games
• A bi-average tree solution for probabilistic communication situations with fuzzy coalition
• Expected values for variable network games
• The Myerson value on local structures of coalitions
• Splitting graphs when calculating Myerson value for pure overhead games.
• A graph-based approach to inequality assessment
• Values on regular games under Kirchhoff's laws
• Probabilistic network values
• The within groups and the between groups Myerson values
• Measuring power in coalitional games with friends, enemies and allies
• Values of games with weighted graphs
• The probabilistic Harsanyi power solutions for probabilistic graph games
• Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
• The Myerson value for games with weighted signed networks
• Allocation rules for communication situations with incompatibilities
• A simple bargaining procedure for the Myerson value
• Graph monotonic values
• scientific article; zbMATH DE number 1047712 (Why is no real title available?)
• A probabilistic position value
• A Banzhaf value for games with a proximity relation among the agents
• A value for generalized probabilistic communication situations
• A value for cooperative games with coalition and probabilistic graph structures
• Values of Graph-Restricted Games
• Uncertain production environment and communication structure

This page was built for publication: Values of games with probabilistic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296512)