A bankruptcy approach to the core cover

DOI10.1007/s00186-012-0409-2zbMath1262.91022OpenAlexW2161426349MaRDI QIDQ1935955

María Gloria Fiestras-Janeiro, Arantza Estévez-Fernández, Manuel A. Mosquera, Estela Sánchez Rodríguez

Publication date: 20 February 2013

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

Full work available at URL: http://hdl.handle.net/11093/1049

zbMATH Keywords

complexitycooperative game theorycore coverbankruptcy gamecompromise admissible gamecompromise stable game

Mathematics Subject Classification ID

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

Related Items (4)

A precedence constraint value revisited ⋮ C-complete sets for compromise stable games ⋮ Nontransferable utility bankruptcy games ⋮ The boundary of the core of a balanced game: face games

Cites Work

• Unnamed Item
• Unnamed Item
• Game theoretic analysis of a bankruptcy problem from the Talmud
• Super-modularity: Applications to convex games and to the greedy algorithm for LP
• A problem of rights arbitration from the Talmud
• Cores of convex and strictly convex games
• Compromise solutions based on bankruptcy
• Cores of convex games
• A geometric characterisation of the compromise value
• The core cover in relation to the nucleolus and the Weber set
• A quadratic programming model for product configuration optimization

This page was built for publication: A bankruptcy approach to the core cover