Research map / Learning theory and algorithms / Submodular and game algorithms
Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| replace constant Myerson pricing with optimal tau-step algorithm (tau=2..6) | seller pricing · infinite game, uniform valuation, gamma_S>=gamma_B | expected strategic revenue: up to +20% | Helped |
| increase number of steps tau in the pricing algorithm (ablation) | optimal tau-step algorithm · infinite game, uniform valuation | expected strategic revenue | Helped |
| use big-deal algorithm instead of constant Myerson pricing when seller is less patient | seller pricing · gamma_S < gamma_B (theory) | expected revenue | Helped |
| make seller discount closer to buyer discount | optimal algorithm · uniform valuation | revenue gain over constant pricing | Hurt |
Closest papers by meaning
- Weakly Consistent Optimal Pricing Algorithms in Repeated Posted-Price Auctions with Strategic Buyer (ICML 2018 · similarity 0.93)
- Reserve Pricing in Repeated Second-Price Auctions with Strategic Bidders (ICML 2020 · similarity 0.90)
- Sample Complexity of Posted Pricing for a Single Item (NeurIPS 2024 · similarity 0.90)
- Optimal Auction Design for Mixed Bidders (AAAI 2025 · similarity 0.87)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.86)
- Procurement Auctions via Approximately Optimal Submodular Optimization (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.