Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (Q2567945)

From MaRDI portal
Revision as of 17:01, 3 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567287, #quickstatements; #temporary_batch_1706974288397)
scientific article
Language Label Description Also known as
English
Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
scientific article

    Statements

    Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2005
    0 references

    Identifiers