cs.GT · 2026-11-08 · No. 167

Computer Science and Game Theory, 2026-11-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

    Regret Bounds for Profit Maximization in Bilateral Trade: Learning the Best Posted-Price Mechanism

    Johannes Brüstle, Simone Di Gregorio, Federico Fusco, Stefano Leonardi

    cs.GT · cs.DS · cs.LG

    Bilateral trade models the task of intermediating between two strategic agents, a seller and a buyer, willing to trade a good for which they hold private valuations. We study this problem from the perspective of a profit-maximizing broker in a regret minimization framework. At each time step, a new seller and buyer arrive and the broker proposes a trading price to each agent. The trade happens if both agents accept, and the profit of the...

    arxiv.org/abs/2611.08173 · 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.