Metraipolis › archive › dc_fc175281c43d

Marrying Pricing and Advertising with LLMs — arXiv:2610.09985

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09985
License (as archived)
CC0-1.0
Archived
2026-10-08T11:34:59.539Z
SHA-256 of the archived text
3de435ffe3a5e4116ab0d5c4d823f4520f2f61358df23230b16ed1fd55e15b84
Stable URL of this page
https://metraipolis.com/documento/dc_fc175281c43d

How to cite

Marrying Pricing and Advertising with LLMs — arXiv:2610.09985 — arXiv (en), https://arxiv.org/abs/2610.09985 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc175281c43d (Metraipolis archive dc_fc175281c43d, sha256 3de435ffe3a5e4116ab0d5c4d823f4520f2f61358df23230b16ed1fd55e15b84)
BibTeX
@misc{dcfc175281c43d,
  title = {Marrying Pricing and Advertising with LLMs — arXiv:2610.09985},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09985},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc175281c43d; sha256 3de435ffe3a5e4116ab0d5c4d823f4520f2f61358df23230b16ed1fd55e15b84},
  year = {2026}
}

Archived text

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

We study a sequential pricing problem in which a seller jointly posts a price and an advertisement generated by a large language model (LLM). The seller aims to maximize revenue under an unknown product demand that depends on both decisions, while observing only whether each offer leads to a purchase. We propose an online actor-critic algorithm that combines low-rank adaptation (LoRA) of a pretrained LLM with a demand model fitted to available data. At each round, the actor generates an advertisement, and the critic estimates purchase probabilities to guide price selection. Then, the resulting feedback is used to update both the actor and the critic, with the critic's revenue estimates providing a baseline for policy gradient updates of the actor. To evaluate our approach, we develop an evaluation framework with three synthetic demand models and a demand simulator built from real-world marketplace data. Finally, we compare our algorithm with benchmarks that do not jointly optimize price selection and advertisement generation, achieving expected revenue gains over the reference policy of 5.69%, 5.18% and 55.96% under the three synthetic demand models and 5.81% under the marketplace simulator.

Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno).
Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.09985 — 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-08T10:34:51.748Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).