k-convexn-person games and their cores

DOI10.1007/BF01918631zbMath0597.90094OpenAlexW1983922614MaRDI QIDQ3731394

Theo S. H. Driessen

Publication date: 1986

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

coregap functionmarginal worth vectorsside-payment game\(k\)-convex game

Mathematics Subject Classification ID

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

Related Items (12)

Set-valued TU-games ⋮ An axiomatization of the \(\tau\)-value ⋮ Solution concepts of \(k\)-convex \(n\)-person games ⋮ Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof ⋮ A bankruptcy problem and an information trading problem: Applications tok-convex games ⋮ A note on a core catcher of a cooperative game ⋮ Matrix analysis for associated consistency in cooperative game theory ⋮ Bargaining property of nucleolus and \(\tau\)-value in a class of TU-games ⋮ Characterizations ofk-Convex Games ⋮ Games on fuzzy communication structures with Choquet players ⋮ An extension of the \(\tau\)-value to games with coalition structures. ⋮ A behavioral foundation for fuzzy measures

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of 1-convex \(n\)-person games
• Generalized k-quota solutions for (N,k) games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• Extreme games and their solutions
• Cores of convex games
• A Simple Expression for the Shapley Value in a Special Case

This page was built for publication: k-convexn-person games and their cores