On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Dimitris Paparas / rank
Normal rank
 
Property / author
 
Property / author: Dimitris Paparas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing lotteries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The menu-size complexity of revenue approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Approximately Optimal Mechanism for an Additive Buyer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-minded unlimited supply pricing on sparse instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Budgets and the Envy-Free Pricing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme-Value Theorems for Optimal Multidimensional Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimal multidimensional pricing for a unit-demand buyer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of randomness in Bayesian optimal mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Optimal Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for a Multiple-Good Monopolist / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination can be hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling and Representation Complexity of Revenue Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate revenue maximization with multiple items / rank
 
Normal rank
Property / cites work
 
Property / cites work: On revenue maximization for selling multiple independently distributed items / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundling as an optimal selling mechanism for a multiple-good monopolist / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Auction Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Mechanism for Selling Two Goods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haggling over substitutes / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i>-to-1 Bidder Reduction for Multi-item Auctions and its Applications / rank
 
Normal rank

Latest revision as of 04:35, 29 July 2024

scientific article; zbMATH DE number 7534659
Language Label Description Also known as
English
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
scientific article; zbMATH DE number 7534659

    Statements

    On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2022
    0 references
    lottery pricing
    0 references
    optimal mechanism design
    0 references
    unit-demand buyer
    0 references

    Identifiers