C-complete sets for compromise stable games

DOI10.1007/S00186-014-0477-6MaRDI QIDQ471023zbMATH OpenOpenAlexFDO

Authors Trine Tornøe Platz, Herbert Hamers, Marieke Quant

Publication date 13 November 2014

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://www.sdu.dk/-/media/files/om_sdu/institutter/ivoe/disc_papers/disc_2012/dpbe25_2012.pdf

zbMATH Keywords

corecore coverlarginal vectorsTU-game

Mathematics Subject Classification ID

Cooperative games (91A12)

Review text

The paper investigates the relationship between compromise stability of transferable utility games and efficient payoff vectors; specifically, the main results study the structure of the generators of the core cover, and conditions ensuring that the game is compromise stable.

Recommendations

• Determining the nucleolus of compromise stable games
• The core cover in relation to the nucleolus and the Weber set
• scientific article; zbMATH DE number 850296
• A bankruptcy approach to the core cover
• Conditions on core stability of covering games

Cites work

• A bankruptcy approach to the core cover
• A quadratic programming model for product configuration optimization
• Characterizing convexity of games using marginal vectors
• Clan games
• Convexity and marginal vectors
• Cores of convex games
• Even and odd marginal worth vectors, Owen's multilinear extension and convex games
• scientific article; zbMATH DE number 3754445 (Why is no real title available?)
• scientific article; zbMATH DE number 863477 (Why is no real title available?)
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• scientific article; zbMATH DE number 3078999 (Why is no real title available?)
• Properties of 1-convex n-person games
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• The core cover in relation to the nucleolus and the Weber set
• The Nucleolus of a Characteristic Function Game

Cited in

(3)

• The core cover in relation to the nucleolus and the Weber set
• The minimum set of \(\mu\)-compatible subgames for obtaining a stable set in an assignment game
• Determining the nucleolus of compromise stable games

This page was built for publication: C-complete sets for compromise stable games

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