Pages that link to "Item:Q5363023"
From MaRDI portal
The following pages link to An <i>n</i>-to-1 Bidder Reduction for Multi-item Auctions and its Applications (Q5363023):
Displaying 20 items.
- Optimal mechanisms with simple menus (Q516055) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- Approximate revenue maximization with multiple items (Q1676468) (← links)
- Risk-robust mechanism design for a prospect-theoretic buyer (Q2147995) (← links)
- On symmetries in multi-dimensional mechanism design (Q2152104) (← links)
- Buy-many mechanisms are not much better than item pricing (Q2155888) (← links)
- The menu-size complexity of revenue approximation (Q2155903) (← links)
- Selling multiple correlated goods: revenue maximization and menu-size complexity (Q2324834) (← links)
- Bounding the optimal revenue of selling multiple goods (Q2345450) (← links)
- Optimal mechanisms for selling two items to a single buyer having uniformly distributed valuations (Q2425138) (← links)
- On optimal mechanisms in the two-item single-buyer unit-demand setting (Q2425139) (← links)
- Bayesian auctions with efficient queries (Q2667811) (← links)
- Duality and Optimality of Auctions for Uniform Distributions (Q3133819) (← links)
- A Simple and Approximately Optimal Mechanism for a Buyer with Complements (Q4994150) (← links)
- A Duality-Based Unified Approach to Bayesian Mechanism Design (Q4997317) (← links)
- Brief Announcement: Bayesian Auctions with Efficient Queries. (Q5002792) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- Tight Revenue Gaps Among Simple Mechanisms (Q5123985) (← links)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
- Multi-Item Nontruthful Auctions Achieve Good Revenue (Q5885584) (← links)
