A simple procedure to obtain the extreme core allocations of an assignment market (Q2384724)

From MaRDI portal
Revision as of 21:30, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simple procedure to obtain the extreme core allocations of an assignment market
scientific article

    Statements

    A simple procedure to obtain the extreme core allocations of an assignment market (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    An algorithm is provided to determine the extreme core allocations of an assignment game. Given an assignment market, a set of vectors is defined, one for each possible ordering on the player set. Each one of these vectors is obtained recursively only making use of the assignment matrix. Those vectors that are efficient turn out to give the extreme core allocations of the market.
    0 references
    assignment game
    0 references
    core
    0 references
    extreme core points
    0 references
    max-payoff vectors
    0 references

    Identifiers