Monge extensions of cooperation and communication structures

DOI10.1016/J.EJOR.2010.01.043MaRDI QIDQ976406zbMATH OpenOpenAlexFDO

Authors U. Faigle, Michel Grabisch, M. Heyne

Publication date 11 June 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2010.01.043

zbMATH Keywords

communication structureconvex gamecooperation structureLovász extensionmarginal valueMonge extensionrankingShapley valuesupermodularityWeber set

Mathematics Subject Classification ID

Cooperative games (91A12) Other game-theoretic models (91A40)

Recommendations

• scientific article; zbMATH DE number 1163151
• On the convexity of communication games
• THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES
• Cooperative games on convex geometries with a coalition structure
• Marginality and convexity in partition function form games

Cites work

• A discrete Choquet integral for ordered systems
• Cooperative games on antimatroids
• Cooperative Games under Augmenting Systems
• Cores of convex games
• Cores of games with restricted cooperation
• Games on lattices, multichoice games and the Shapley value: a new approach
• Games with permission structures: The conjunctive approach
• Geometries on partially ordered sets
• Graphs and Cooperation in Games
• Greedoids
• Hierarchical organization structures and constraints on coalition formation
• scientific article; zbMATH DE number 5764848 (Why is no real title available?)
• scientific article; zbMATH DE number 3904328 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Integral Representation Without Additivity
• On the core of ordered submodular cost games
• Shapley value for multichoice cooperative games. I
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• The core and the Weber set of games on augmenting systems
• The core of games on convex geometries
• The Lovász extension of market games
• The Myerson value for union stable structures
• The Shapley value for cooperative games under precedence constraints
• Theory of capacities
• Values on regular games under Kirchhoff's laws

Cited in

(15)

• Inheritance of convexity for partition restricted games
• The Myerson value and superfluous supports in union stable systems
• On the restricted cores and the bounded core of games on distributive lattices
• Harsanyi power solutions for games on union stable systems
• A ranking model for the greedy algorithm and discrete convexity
• Solution concepts for games with general coalitional structure
• The Lovász extension of market games
• Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game
• Fuzzy measures and integrals: recent developments
• Convexity of graph-restricted games induced by minimum partitions
• Incomplete cooperative games with player-centered information
• On cycle-free accessible union stable network structures
• Cooperative games with restricted formation of coalitions
• Ensuring the boundedness of the core of games with restricted cooperation
• Games on concept lattices: Shapley value and core

This page was built for publication: Monge extensions of cooperation and communication structures

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