Solution concepts of \(k\)-convex \(n\)-person games

DOI10.1007/BF01769385zbMath0633.90097OpenAlexW2496445699MaRDI QIDQ1096552

Theo S. H. Driessen

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1007/bf01769385

zbMATH Keywords

Shapley valuecorekernelnucleolusbargaining set\(\tau\)-valuegeometrical propertiesprekernel\(k\)-convex game

Mathematics Subject Classification ID

Cooperative games (91A12) (n)-person games, (n>2) (91A06)

Related Items

Static game theory models and their applications in management science, A bankruptcy problem and an information trading problem: Applications tok-convex games, Nash equilibria in a model of multiproduct price competition: an assignment problem, Characterizations ofk-Convex Games, The Shapley value and average convex games, A necessary and sufficient condition for the convexity in oligopoly games, On the contribution of an additional player to a convex game

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of 1-convex \(n\)-person games
• The \(\tau\)-value, the core and semiconvex games
• Generalized k-quota solutions for (N,k) games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• A characterization, existence proof and dimension bounds for the kernel of a game
• The inequalities that determine the bargaining set \({\mathcal M}_ 1^ {(1)}\).
• Cores of convex games
• Cores of exact games. I
• The kernel and bargaining set for convex games
• k-convexn-person games and their cores
• Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
• A Simple Expression for the Shapley Value in a Special Case
• The Structure of the Kernel of a Cooperative Game
• The Nucleolus of a Characteristic Function Game
• The kernel of a cooperative game
• On the Nucleolus of a Characteristic Function Game