A bankruptcy approach to the core cover (Q1935955): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Game theoretic analysis of a bankruptcy problem from the Talmud / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic programming model for product configuration optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex and strictly convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric characterisation of the compromise value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem of rights arbitration from the Talmud / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core cover in relation to the nucleolus and the Weber set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compromise solutions based on bankruptcy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937173 / rank
 
Normal rank

Revision as of 05:41, 6 July 2024

scientific article
Language Label Description Also known as
English
A bankruptcy approach to the core cover
scientific article

    Statements

    A bankruptcy approach to the core cover (English)
    0 references
    20 February 2013
    0 references
    cooperative game theory
    0 references
    compromise admissible game
    0 references
    compromise stable game
    0 references
    bankruptcy game
    0 references
    core cover
    0 references
    complexity
    0 references

    Identifiers