Optimal item pricing in online combinatorial auctions
From MaRDI portal
Publication:6589756
Recommendations
Cites work
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- scientific article; zbMATH DE number 1219592 (Why is no real title available?)
- scientific article; zbMATH DE number 7788378 (Why is no real title available?)
- A constant factor prophet inequality for online combinatorial auctions
- Algorithmic Game Theory
- An improved lower bound for matroid intersection prophet inequalities
- Approximation algorithms for combinatorial auctions with complement-free bidders
- Combinatorial Walrasian equilibrium
- Combinatorial auctions via posted prices
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Computing Walrasian equilibria: fast algorithms and structural properties
- Matroid prophet inequalities
- Multi-parameter mechanism design and sequential posted pricing
- Non-approximability results for optimization problems on bounded degree instances
- Online contention resolution schemes
- Online mechanism design (randomized rounding on the fly)
- Prophet inequalities made easy: stochastic optimization by pricing nonstochastic inputs
- Simple mechanisms for subadditive buyers via duality
- Understanding preferences: ``demand types, and the existence of equilibrium with indivisibilities
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)