Optimal Design for Multi-Item Auctions: A Robust Optimization Approach
From MaRDI portal
Publication:5247609
DOI10.1287/moor.2014.0645zbMath1312.91054OpenAlexW2170894177MaRDI QIDQ5247609
Chaithanya Bandi, Dimitris J. Bertsimas
Publication date: 24 April 2015
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2014.0645
Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items
Robust pooling for contracting models with asymmetric information ⋮ Robust trading mechanisms over 0/1 polytopes ⋮ Robust Queueing Theory ⋮ Robust optimization strategies for seller based on uncertainty sets in context of sequential auction ⋮ Stochastic optimization in supply chain networks: averaging robust solutions ⋮ Robust feasibility of systems of quadratic equations using topological degree theory ⋮ Robust auction design under multiple priors by linear and integer programming ⋮ Robust screening under ambiguity ⋮ Tractable stochastic analysis in high dimensions via robust optimization ⋮ Robust Inventory Management: An Optimal Control Approach ⋮ Robust Auctions for Revenue via Enhanced Competition ⋮ Optimal Design for Multi-Item Auctions: A Robust Optimization Approach ⋮ Robust multidimensional pricing: separation without regret ⋮ Regret-minimizing Bayesian persuasion
Cites Work
- A Mathematical Theory of Communication
- Robust option pricing
- Haggling over substitutes
- Tractable stochastic analysis in high dimensions via robust optimization
- Multi-unit auctions with budget limits
- A new reformulation-linearization technique for bilinear programming problems
- Robust solutions of uncertain linear programs
- Optimal auction with financially constrained buyers
- Expected revenue of all-pay auctions and first-price sealed-bid auctions with budget constraints
- Robust discrete optimization and network flows
- The optimal mechanism for selling to a budget-constrained buyer
- Robust solutions of linear programming problems contaminated with uncertain data
- Revenue maximization with a single sample
- Optimal auctions with financially constrained buyers
- Multidimensional mechanism design: revenue maximization and the multiple-good monopoly
- Competitive auctions
- Multiple-Object Auctions with Budget Constrained Bidders
- Robust Convex Optimization
- Multi-parameter mechanism design and sequential posted pricing
- Theory and Applications of Robust Optimization
- Robust Queueing Theory
- The Price of Robustness
- Optimal Auction Design
- Incentives in Teams
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Optimal Design for Multi-Item Auctions: A Robust Optimization Approach
- On optimal single-item auctions
This page was built for publication: Optimal Design for Multi-Item Auctions: A Robust Optimization Approach