Research map / Learning theory and algorithms / Submodular and game algorithms
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions
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.
Closest papers by meaning
- Robust Pricing in Dynamic Mechanism Design (ICML 2020 · similarity 0.94)
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.91)
- Safely Learning Optimal Auctions: A Testable Learning Framework for Mechanism Design (ICML 2025 · similarity 0.89)
- Contextual Dynamic Pricing with Heterogeneous Buyers (NeurIPS 2025 · similarity 0.88)
- Learning Optimal Auctions with Correlated Value Distributions (AAAI 2025 · similarity 0.88)
- Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions (ICML 2025 · similarity 0.87)
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.