Metraipolis › archive › dc_04f33936d689

Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue — arXiv:2608.03142

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03142
License (as archived)
CC0-1.0
Archived
2026-10-31T12:18:36.817Z
SHA-256 of the archived text
6d4a5d1d067c7724eac5509a8caced3cf9cc467cbe44655b9333c748ea9b6df8
Stable URL of this page
https://metraipolis.com/documento/dc_04f33936d689

How to cite

Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue — arXiv:2608.03142 — arXiv (en), https://arxiv.org/abs/2608.03142 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_04f33936d689 (Metraipolis archive dc_04f33936d689, sha256 6d4a5d1d067c7724eac5509a8caced3cf9cc467cbe44655b9333c748ea9b6df8)
BibTeX
@misc{dc04f33936d689,
  title = {Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue — arXiv:2608.03142},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03142},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_04f33936d689; sha256 6d4a5d1d067c7724eac5509a8caced3cf9cc467cbe44655b9333c748ea9b6df8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.03142. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study contextual dynamic pricing with arbitrary covariate sequences and bounded, possibly nonbinary purchase quantities. Demand follows a semiparametric surplus-index model with an unknown linear valuation parameter and an unknown Hölder-smooth response. We impose neither concavity nor strong unimodality on revenue and allow nonunique optimal prices. We develop a pilot-corrected layered decision-partitioning policy that combines directional pilot estimation, local polynomial learning, predictable data assignment, and global action elimination. Pilot correction removes the first-order effect of valuation-parameter error, while permanent labels enable concentration under adaptive sampling. The policy attains the minimax smoothness-dependent horizon rate up to logarithmic factors; a matching lower bound already holds for a constant-context binary-demand subclass.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-05 in cs.AI).
Categorie arXiv: Machine Learning (stat.ML) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.03142 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T12:05:53.006Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).