The core of games on ordered structures and graphs

DOI10.1007/s10288-009-0109-9zbMath1230.91014arXiv1304.1075OpenAlexW2123343544MaRDI QIDQ5902298

Michel Grabisch

Publication date: 2 December 2009

Published in: Annals of Operations Research, 4OR (Search for Journal in Brave)

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

zbMATH Keywords

cooperative gamescorepartially ordered setTU-gamecommunication graphsolution conceptfeasible coalition

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)

Related Items (27)

Characterizations of solutions for games with precedence constraints ⋮ Order cones: a tool for deriving \(k\)-dimensional faces of cones of subfamilies of monotone games ⋮ Generalized minimum spanning tree games ⋮ Remarkable polyhedra related to set functions, games and capacities ⋮ Twelve surveys in operations research ⋮ On a class of vertices of the core ⋮ Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game ⋮ Centroids of the core of exact capacities: a comparative study ⋮ Games on concept lattices: Shapley value and core ⋮ The complexity of power indexes with graph restricted coalitions ⋮ Incomplete cooperative games with player-centered information ⋮ Optimal coalition formation and surplus distribution: two sides of one coin ⋮ Games induced by the partitioning of a graph ⋮ Finding the Set of k-additive Dominating Measures Viewed as a Flow Problem ⋮ On the set of imputations induced by the \(k\)-additive core ⋮ Surveys in operations research ⋮ The cone of supermodular games on finite distributive lattices ⋮ Inheritance of convexity for partition restricted games ⋮ The core of games on ordered structures and graphs ⋮ Games with a permission structure -- a survey on generalizations and applications ⋮ The restricted core of games on distributive lattices: how to share benefits in a hierarchy ⋮ On the restricted cores and the bounded core of games on distributive lattices ⋮ Weighted component fairness for forest games ⋮ Multi-sided assignment games on \(m\)-partite graphs ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Ensuring the boundedness of the core of games with restricted cooperation ⋮ Convexity of graph-restricted games induced by minimum partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The restricted core of games on distributive lattices: how to share benefits in a hierarchy
• A discrete Choquet integral for ordered systems
• Average tree solutions and the distribution of Harsanyi dividends
• Values for rooted-tree and sink-tree digraph games and sharing a river
• Weighted component fairness for forest games
• Ensuring the boundedness of the core of games with restricted cooperation
• On the convexity of communication games
• The core and the Weber set of games on augmenting systems
• Monge extensions of cooperation and communication structures
• Values on regular games under Kirchhoff's laws
• Axiomatizations of the Shapley value for games on augmenting systems
• Rooted-tree solutions for tree games
• The theory of convex geometries
• Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
• Conference structures and fair allocation rules
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Cores of partitioning games
• Global games
• Allocation rules for hypergraph communication situations
• Games with permission structures: The conjunctive approach
• Strongly balanced cooperative games
• The Shapley value for cooperative games under precedence constraints
• Cooperative games with coalition structures
• Values of games in partition function form
• Orderings, excess functions, and the nucleolus
• Intermediate preferences and stable coalition structures
• The core of games on convex geometries
• Cooperative games on antimatroids
• Sharing a river.
• \(\Gamma\)-component additive games
• Hierarchical organization structures and constraints on coalition formation
• The bounded core for games with precedence constraints
• On the core of a collection of coalitions.
• On the Harsanyi payoff vectors and Harsanyi imputations
• Component efficient solutions in line-graph games with applications
• An axiomatization of entropy of capacities on set systems
• On hierarchies and communication
• The average tree solution for cycle-free graph games
• A class of consistent share functions for games in coalition structure
• Cores of convex games
• Cores of exact games. I
• Submodular functions and optimization.
• Lattices with unique irreducible decompositions
• Theory of capacities
• A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
• Values of Graph-Restricted Games
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games
• Cores of games with restricted cooperation
• Lectures on Polytopes
• Cooperative Games under Augmenting Systems
• The Nucleolus of a Characteristic Function Game
• The kernel of a cooperative game
• Existence of stable payoff configurations for cooperative games
• A Simplified Bargaining Model for the n-Person Cooperative Game
• A Limit Theorem on the Core of an Economy
• Introduction to the Theory of Cooperative Games
• The core of games on ordered structures and graphs
• A unified approach to restricted games.

This page was built for publication: The core of games on ordered structures and graphs