The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming

DenaMarkudova MartinoTrevisan PaoloGarza MichelaMeo M. M. Munaf GiovannaCarofiglio Politecnico di Torino

· 0 citations · 15 references

TL;DR

This paper introduces a machine learning-based sys-tem for identifying the traﬃc of RTC applications that builds on the domains contacted before starting a call and leverages techniques from Natural Language Processing (NLP) to build meaningful features.

Semantic Scholar

View source

Similar papers

#machine learning Preprint Sep 2026

Adapting to Decision-Relevant Non-Stationarity in Decentralized Heterogeneous Bandits

This work introduces Decision-Relevant Fresh Comparison (DRFC), which uses new, balanced samples from all agents to compare arms at the network level and switches only when fresh global evidence indicates that the common best arm has changed, and proves a high-probability dynamic regret bound with no adaptation term de...

Zhao-Jun Peng · 0 citations

Preprint Aug 2026

LLMs Can Design Near-Optimal OR Algorithms

For the well-specified operations problems the authors study, a single untuned LLM query can already produce algorithms competitive with specialized methods, suggesting that frontier LLMs can be a serious empirical baseline for algorithm design in well-specified OR problems.

Jackie Baek · 0 citations

#artificial intelligence Preprint Aug 2026

COVER: Identifiable Evaluation of Coalition Routing

COLD is an auditable measurement methodology, an evaluation contract that fixes a public information boundary, downstream stack G, and finite legal team family before outcomes are generated, which exposes selection headroom without manufacturing a routing win.

R. Sugumar, Amrit Gopinath · 0 citations

#machine learning Preprint Sep 2026

Resource-Adaptive Stochastic Gradient Descent for Online Linear Programming without Re-solving

Numerical experiments show that RASGD achieves regret competitive with per-arrival LP re-solving and improves upon the tested first-order baselines, while retaining the computational efficiency of first-order methods.

Jiameng Lyu · 0 citations

Preprint Aug 2026

Routing Is Least Learnable Where It Is Most Valuable: Bounds on Representation Routing for Web Agents

Web agents observe a browser through text, pixels, or both, and the choice is usually fixed once for all tasks, so a stronger agent can overturn the result, and the rerun noise bands and the full measurement protocol are reported.

Jiaming Wei, Zekun Wu, A. Koshiyama et al. · 0 citations

#artificial intelligence Preprint Sep 2026

Agentic Algorithm Engineering: Improving Shared-Memory Exact Minimum Cuts

This work improves the minimum cut problem for an undirected edge-weighted graph using agentic algorithm engineering (AAE), a methodology that is available in the open-source package VieCut and has outperformed the previously fastest solvers by a factor of up to 2.5 sequentially and up to 12.9 when run in parallel.

David A. Bader, Adil Chhabra, Ernestine Großmann et al. · 0 citations