Pages that link to "Item:Q5133980"
From MaRDI portal
The following pages link to A Simple and Approximately Optimal Mechanism for an Additive Buyer (Q5133980):
Displaying 21 items.
- A note on the buyer's problem (Q1108723) (← links)
- Selling two goods optimally (Q1641015) (← links)
- Approximate revenue maximization with multiple items (Q1676468) (← links)
- Selling two identical objects (Q2123177) (← links)
- Risk-robust mechanism design for a prospect-theoretic buyer (Q2147995) (← links)
- Obvious strategyproofness, bounded rationality and approximation (Q2147998) (← links)
- The optimality of upgrade pricing (Q2152102) (← links)
- On symmetries in multi-dimensional mechanism design (Q2152104) (← links)
- Buy-many mechanisms are not much better than item pricing (Q2155888) (← links)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- On the computational complexity of optimal simple mechanisms (Q2800549) (← links)
- Duality and Optimality of Auctions for Uniform Distributions (Q3133819) (← links)
- Simple mechanisms for subadditive buyers via duality (Q4977970) (← links)
- A Duality-Based Unified Approach to Bayesian Mechanism Design (Q4997317) (← links)
- On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer (Q5080487) (← links)
- On revenue maximization for selling multiple independently distributed items (Q5171012) (← links)
- The Complexity of Contracts (Q5856150) (← links)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions (Q5864664) (← links)
- Generalized Permutahedra and Optimal Auctions (Q5886833) (← links)
- Online random sampling for budgeted settings (Q5919606) (← links)
- Buy-many mechanisms for many unit-demand buyers (Q6609124) (← links)
