Optimal item pricing in online combinatorial auctions
From MaRDI portal
Publication:2164686
DOI10.1007/978-3-031-06901-7_10zbMath1497.91133OpenAlexW4285273684MaRDI QIDQ2164686
José R. Correa, Tristan Pollner, Andrés Cristi, S. Matthew Weinberg, Andrés Fielbaum
Publication date: 16 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06901-7_10
Cites Work
- Unnamed Item
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Computing Walrasian equilibria: fast algorithms and structural properties
- Multi-parameter mechanism design and sequential posted pricing
- Online Mechanism Design (Randomized Rounding on the Fly)
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs
- Combinatorial Walrasian Equilibrium
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Online Contention Resolution Schemes
- Simple mechanisms for subadditive buyers via duality
- Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
- Non-approximability results for optimization problems on bounded degree instances
- Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities
- Combinatorial Auctions via Posted Prices
- Matroid prophet inequalities
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
This page was built for publication: Optimal item pricing in online combinatorial auctions
