Optimal item pricing in online combinatorial auctions
Authors:
- 28 October 2023
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 206 (1-2) , 429-460
Abstract
No abstract availableKeywords
Funding Information
- Agencia Nacional de Investigación y Desarrollo (FB210005, ACT210005)
This publication has 23 references indexed in Scilit:
- The Invisible Hand of Dynamic Market Pricing2016
- Mechanism Design for Subadditive Agents via an Ex Ante Relaxation2016
- Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders2016
- Combinatorial Walrasian EquilibriumSIAM Journal on Computing, 2016
- Online Contention Resolution Schemes2015
- Combinatorial Auctions via Posted Prices2014
- On the efficiency of the walrasian mechanism2014
- Online Mechanism Design (Randomized Rounding on the Fly)2012
- Approximation algorithms for combinatorial auctions with complement-free bidders2005
- Comparison of Threshold Stop Rules and Maximum for Independent Nonnegative Random VariablesThe Annals of Probability, 1984