A bankruptcy approach to the core cover

DOI10.1007/S00186-012-0409-2MaRDI QIDQ1935955zbMATH OpenOpenAlexFDO

Authors Arantza Estévez-Fernández, M. G. Fiestras-Janeiro, 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

bankruptcy gamecomplexitycompromise admissible gamecompromise stable gamecooperative game theorycore cover

Mathematics Subject Classification ID

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

Recommendations

• Equivalence of axioms for bankruptcy problems
• A new approach for bounding awards in bankruptcy problems
• New characterizations of a classical bankruptcy rule
• The bankruptcy problem: A cooperative bargaining approach
• A new prospect of additivity in bankruptcy problems
• The reverse TAL-family of rules for bankruptcy problems
• Integer solutions to bankruptcy problems with non-integer claims
• Integer solutions to bankruptcy problems: the IPROP solution
• Equalizing solutions for bankruptcy problems revisited
• The TAL-family of rules for bankruptcy problems

Cites work

• A geometric characterisation of the compromise value
• A problem of rights arbitration from the Talmud
• A quadratic programming model for product configuration optimization
• Compromise solutions based on bankruptcy
• Cores of convex and strictly convex games
• Cores of convex games
• Game theoretic analysis of a bankruptcy problem from the Talmud
• scientific article; zbMATH DE number 3754445 (Why is no real title available?)
• scientific article; zbMATH DE number 1929535 (Why is no real title available?)
• 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

Cited in

(9)

• Nontransferable utility bankruptcy games
• Compromise solutions based on bankruptcy
• A geometric characterisation of the compromise value
• The core cover in relation to the nucleolus and the Weber set
• A precedence constraint value revisited
• C-complete sets for compromise stable games
• The Bilateral Consistent Prekernel, the Core, and NTU Bankruptcy Problems
• An algorithm to compute the average-of-awards rule for claims problems with an application to the allocation of \(\mathrm{CO}_2\) emissions
• The boundary of the core of a balanced game: face games

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

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