Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (Q4997307)

From MaRDI portal
Revision as of 16:10, 2 May 2024 by EloiFerrer (talk | contribs) (‎Changed label, description and/or aliases in en, and other parts)
No description defined
Language Label Description Also known as
English
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
No description defined

    Statements

    Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders (English)
    0 references
    0 references
    0 references
    29 June 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial auctions
    0 references
    truthful mechanisms
    0 references
    approximation algorithms
    0 references
    0 references