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

Trend · papers per month

count% of corpus
0111 · Mar 202319922001200920172026
3 results for “PPAD-hardness”
Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swapscs.GT

Improved hardness results for clearing payments in financial networks with CDSs.

problem Determining clearing payments in financial networks with CDSs after financial shocks.
method Analyzing computational complexity of clearing problems, showing PPAD-hardness and FIXP-completeness improvements.
result PPAD-hardness of clearing problem significantly improved to ε ≈ 0.101.
financial networksclearing paymentsPPAD-hardnessFIXP-completenesscredit default swaps
2024-09-27abs ↗pdf ↗
Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Gamescs.LG

New research shows no-regret learning is impossible in Markov games under certain assumptions.

problem Achieving no-regret learning in decentralized Markov games.
method Novel application of aggregation techniques from online learning to prove lower bounds.
result No polynomial-time algorithm exists for independent no-regret learning in general-sum Markov games.
Markov GamesNo-Regret LearningSparse Correlated EquilibriumPPAD-hard ProblemsAggregation Techniques
2023-03-22abs ↗pdf ↗