Limitations of randomized mechanisms for combinatorial auctions (Q2516249): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1109.1055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Informational limitations of ascending combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3588651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Randomized Mechanisms for Combinatorial Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An impossibility result for truthful combinatorial auctions with submodular valuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Randomization in Algorithmic Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful randomized mechanisms for combinatorial auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From query complexity to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: From convex optimization to randomized mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximizing Welfare When Utility Functions Are Subadditive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for combinatorial auctions with submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank

Latest revision as of 16:05, 10 July 2024

scientific article
Language Label Description Also known as
English
Limitations of randomized mechanisms for combinatorial auctions
scientific article

    Statements

    Limitations of randomized mechanisms for combinatorial auctions (English)
    0 references
    0 references
    0 references
    12 August 2015
    0 references
    algorithmic mechanism design
    0 references
    combinatorial auctions
    0 references
    incentive compatibility
    0 references
    submodular valuations
    0 references

    Identifiers