Research
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,657 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Feb 202019922001200920172026
3 results for “non-exploitability”
Balancing Adaptability and Non-exploitability in Repeated Gamescs.GT

LAFF algorithm balances adaptability and non-exploitability in repeated games.

problem Low regret in repeated games against unknown opponent classes.
method LAFF algorithm searches within sub-algorithms optimal for each opponent class and uses a punishment policy for exploitation.
result LAFF guarantees sublinear regret uniformly over possible opponents, except exploitative ones, for which it guarantees linear regret.
repeated gamesnon-exploitabilityregret minimizationmulti-agent learning
2021-12-20abs ↗pdf ↗
Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Gamescs.LG

Paper tackles multiplayer symmetric games, securing equal share for n players.

problem Multiplayer games lack unique equilibria, making guarantees unreliable.
method Identifies conditions for equal share, designs efficient algorithms inspired by no-regret learning.
result Proves algorithms achieve approximate equal share across various settings.
multiplayer gamesequal shareno-regret learningsymmetric gamessecure payoffs
2024-06-06abs ↗pdf ↗
Learning to Resolve Alliance Dilemmas in Many-Player Zero-Sum Gamescs.GT

Zero-sum games have long guided artificial intelligence research, since they possess both a rich strategy space of best-responses and a clear evaluation metric. What's more, competition is a vital mechanism in many real-world multi-agent systems capable of generating intelligent innovations: Darwinian evolution, the ma…

2020-02-27abs ↗pdf ↗