The Shapley value on convex geometries (Q1570819): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A note on voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of convex geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shapley value for cooperative games under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core of ordered submodular cost games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs and Cooperation in Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5407248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal location of candidates in ideological space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank

Revision as of 11:58, 30 May 2024

scientific article
Language Label Description Also known as
English
The Shapley value on convex geometries
scientific article

    Statements

    The Shapley value on convex geometries (English)
    0 references
    16 November 2000
    0 references
    A game on a convex geometry is defined as a real-valued function on the family \(L\) of the closed sets of a closure operator which satisfies the finite Minkowski-Krem-Milman property. If \(L\) is the Boolean algebra \(2^N\), this leads to an \(n\)-person cooperative game. The authors obtain two classes of axioms that give rise to a unique Shapley value for games on convex geometries.
    0 references
    Shapley value for games
    0 references
    convex geometries
    0 references
    0 references
    0 references

    Identifiers