cs.GT · 2026-10-24 · No. 152

Computer Science and Game Theory, 2026-10-24.

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

01 — The papers

2 entries
  1. 01

    Truthful by Omission: Click Thinning for LLM-Native Advertising

    Junhua Liu, Zhicheng Liang, Zejun Zhang, Langzhou He, Feng Qian

    cs.GT · cs.AI · cs.DS

    Generative AI assistants are becoming an advertising medium, embedding sponsored content in their answers. This setting departs from classical position auctions in two ways: an ad's click-through rate depends on the passage that hosts it, and because users stop at their first click, earlier ads take clicks from later ones. This competition for clicks makes truthfulness delicate: a higher bid can reshape the allocation and put a competitor...

    arxiv.org/abs/2610.30999 · PDF

  2. 02

    Equilibria and Learning in Competitive Market Making

    Matteo Onger, Luigi Foscari

    cs.GT · cs.LG · q-fin.TR

    We propose a market-making game played among $N \ge 2$ strategic market makers and a single non-strategic representative trader. In a continuous quote space, standard finite-game arguments do not apply, while non-convex and discontinuous payoffs rule out classical continuous existence results and complicate learning. Nonetheless, we characterize pure-strategy Nash equilibria (PSNEs) and show that at least one PSNE always exists under minimal...

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