Pricing randomized allocations
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Stochastic scheduling theory in operations research (90B36) Auctions, bargaining, bidding and selling, and other market models (91B26)
Recommendations
Cited in
(22)- Team selection factor pricing with discrete and inhomogeneous factors
- The complexity of optimal multidimensional pricing for a unit-demand buyer
- Buy-many mechanisms are not much better than item pricing
- A simple mechanism for a budget-constrained buyer
- Pricing lotteries
- The power of randomness in Bayesian optimal mechanism design
- Optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations
- On optimal mechanisms in the two-item single-buyer unit-demand setting
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
- Extreme value theorems for optimal multidimensional pricing
- Approximately optimal auctions for correlated bidders
- Diffusion auction design
- Randomized allocation processes
- Revenue maximization for selling multiple correlated items
- Nonlinear Pricing with Random Participation
- A Duality-Based Unified Approach to Bayesian Mechanism Design
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
- Efficient computation of optimal auctions via reduced forms
- Derandomization of auctions
- Deterministic refund mechanisms
- Robustly optimal mechanisms for selling multiple goods
- Strategy-proof multi-object mechanism design: ex-post revenue maximization with non-quasilinear preferences
This page was built for publication: Pricing randomized allocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417650)
