cs.GT · 2026-07-08 · No. 47

Computer Science and Game Theory, 2026-07-08.

1 new papers in cs.GT. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Contextual Procurement Auctions with Bandit Learning

    Yiling Chen, Shi Feng, Sadie Zhao

    cs.GT · cs.LG

    We study repeated contextual procurement auctions in which the platform must learn context-dependent product values from bandit feedback. We give an exactly truthful explore-then-commit mechanism with $\widetilde O((ng)^{1/3}T^{2/3})$ regret. We also give a frozen-payment UCB mechanism with a regret-incentive tradeoff: the near-UCB tuning attains \(\widetilde O(\sqrt{ngT})\) welfare regret, while for fixed \(n,g\) its total incentive error is...

    arxiv.org/abs/2607.05813 · PDF

This edition is part of The Daily Abstract — cs.GT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.