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