Optimal item pricing in online combinatorial auctions
From MaRDI portal
Publication:6589756
DOI10.1007/S10107-023-02027-2MaRDI QIDQ6589756FDOQ6589756
Authors: José R. Correa, Andrés Cristi, Andrés Fielbaum, Tristan Pollner, S. Matthew Weinberg 
Publication date: 20 August 2024
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Cites Work
- Algorithmic Game Theory
- Non-approximability results for optimization problems on bounded degree instances
- Multi-parameter mechanism design and sequential posted pricing
- Online contention resolution schemes
- Matroid prophet inequalities
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial Walrasian equilibrium
- Online mechanism design (randomized rounding on the fly)
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Simple mechanisms for subadditive buyers via duality
- Combinatorial auctions via posted prices
- Computing Walrasian equilibria: fast algorithms and structural properties
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Understanding preferences: ``demand types, and the existence of equilibrium with indivisibilities
- Title not available (Why is that?)
- A constant factor prophet inequality for online combinatorial auctions
- An improved lower bound for matroid intersection prophet inequalities
This page was built for publication: Optimal item pricing in online combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589756)
