On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

count % of corpus

2 results for “Nash-regret”

DP-NCB: Privacy Preserving Fair Banditscs.LG

DP-NCB algorithm ensures privacy and fairness in bandit decisions.

problem Achieving both privacy and fairness in bandit algorithms.

method Differentially Private Nash Confidence Bound (DP-NCB) framework.

result DP-NCB achieves optimal Nash regret while maintaining privacy.

Privacy Preserving Fairness Bandits Differential Privacy Nash Regret

2025-08-05abs ↗pdf ↗

Learning in Congestion Games with Bandit Feedbackcs.GT

The paper tackles Nash-regret minimization in congestion games with bandit feedback.

problem Minimizing Nash-regret in congestion games with bandit feedback.

method Proposes centralized and decentralized algorithms for congestion games with bandit feedback, and a centralized algorithm for Markov congestion games.

result Sample complexity depends polynomially on the number of players and facilities, not the size of the action set.

Nash-regret Congestion games Bandit feedback Optimism in the face of uncertainty Frank-Wolfe method

2022-06-04abs ↗pdf ↗