C-complete sets for compromise stable games
From MaRDI portal
Publication:471023
DOI10.1007/s00186-014-0477-6zbMath1304.91026OpenAlexW2109234772MaRDI QIDQ471023
Marieke Quant, Herbert Hamers, Trine Tornøe Platz
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
Cites Work
- Properties of 1-convex \(n\)-person games
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Clan games
- Convexity and marginal vectors
- Characterizing convexity of games using marginal vectors
- Even and odd marginal worth vectors, Owen's multilinear extension and convex games
- A bankruptcy approach to the core cover
- Cores of convex games
- The core cover in relation to the nucleolus and the Weber set
- A quadratic programming model for product configuration optimization
- The Nucleolus of a Characteristic Function Game
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: C-complete sets for compromise stable games
