Combinatorial auctions with verification are tractable (Q2512655)

From MaRDI portal
Revision as of 15:26, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Combinatorial auctions with verification are tractable
scientific article

    Statements

    Combinatorial auctions with verification are tractable (English)
    0 references
    0 references
    0 references
    30 January 2015
    0 references
    mechanism design
    0 references
    foundation of incentive-compatibility
    0 references
    combinatorial auctions
    0 references
    mechanisms with verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers