Optimal item pricing in online combinatorial auctions
From MaRDI portal
Publication:2164686
DOI10.1007/978-3-031-06901-7_10zbMATH Open1497.91133OpenAlexW4285273684MaRDI QIDQ2164686FDOQ2164686
Authors: José R. Correa, Andrés Cristi, Tristan Pollner, 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
Recommendations
Cites Work
- 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?)
- 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
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
Cited In (18)
- Market pricing for matroid rank valuations
- Combinatorial auctions via posted prices
- Estimating intermediate price transitions in online auctions
- Prices in a combinatorial auction
- Dynamic and nonuniform pricing strategies for revenue maximization
- Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
- Optimal item pricing in online combinatorial auctions
- New Results on the Online Pricing Problem
- Item Pricing for Combinatorial Public Projects
- COMPETITIVE ALGORITHMS FOR ONLINE PRICING
- Optimal starting price for eBay-like online auctions
- Welfare maximization with production costs: a primal dual approach
- Pricing commodities
- Welfare and profit maximization with production costs
- Algorithmic pricing for the partial assignment
- A constant factor prophet inequality for online combinatorial auctions
- A Dual Approach for Dynamic Pricing in Multidemand Markets
- Approximation algorithms and online mechanisms for item pricing
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 Q2164686)
