cs.GT · 2026-06-29 · No. 38

Computer Science and Game Theory, 2026-06-29.

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

    Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopes

    Luis Leal

    cs.GT · cs.AI · cs.LG · cs.MA

    Many two-player zero-sum games admit not a unique Nash equilibrium but a convex set of them: a polytope of profiles that all share the minimax value V* yet prescribe different behaviour. Standard solvers each converge to some equilibrium and are treated as interchangeable. We ask whether they instead select different members of the Nash set, systematically as a function of the algorithm rather than the seed. Using a tabular, exactly solvable...

    arxiv.org/abs/2606.28308 · PDF

  2. 02

    Non-Linear Strategic Classification Made Practical

    Jack Geary, Boyan Gao, Henry Gouk

    cs.GT · cs.LG

    Algorithmic developments in Strategic Classification have been mostly limited to linear classifiers in settings where the best response has a closed-form solution or can be easily approximated. While some work has explored the role of non-linear classifiers in strategic settings, progress in this direction is impeded by the computational intractability of the strategic behaviour. Addressing this, we present a novel method for approximating...

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