Optimal item pricing in online combinatorial auctions
From MaRDI portal
Publication:2164686
Recommendations
Cites work
- scientific article; zbMATH DE number 1219592 (Why is no real title available?)
- An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
- 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
Cited in
(18)- Dynamic and nonuniform pricing strategies for revenue maximization
- Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
- Pricing commodities
- Optimal item pricing in online combinatorial auctions
- Market pricing for matroid rank valuations
- Welfare maximization with production costs: a primal dual approach
- Welfare and profit maximization with production costs
- A constant factor prophet inequality for online combinatorial auctions
- Algorithmic pricing for the partial assignment
- A Dual Approach for Dynamic Pricing in Multidemand Markets
- Combinatorial auctions via posted prices
- Approximation algorithms and online mechanisms for item pricing
- COMPETITIVE ALGORITHMS FOR ONLINE PRICING
- Estimating intermediate price transitions in online auctions
- Optimal starting price for eBay-like online auctions
- Prices in a combinatorial auction
- New Results on the Online Pricing Problem
- Item Pricing for Combinatorial Public Projects
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)