Nash
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
STON'R Converges to First-Order Nash~Equilibria of Multiplayer Games
arXiv:2606.09565v1 Announce Type: new Abstract: Nonconcave games present a unique challenge, as neither pure Nash equilibria nor local Nash equilibria (LNE) are guaranteed to exist, even in zero-sum settings. Additionally, computing approximate LNE in smooth multiplayer games over bounded regions is PPAD-hard. These challenges, coupled with the inherent complexity, have driven recent research toward broader equilibrium concepts, such as min-max critical points, and first-order Nash...
Efficient Exploration for Iterative Nash Preference Optimization
arXiv:2606.01382v1 Announce Type: new Abstract: Preference alignment is central to improving large language models, but standard reward-based formulations can be restrictive when human preferences are cyclic, non-transitive, or otherwise not representable by a scalar reward. Nash Learning from Human Feedback (NLHF) addresses this limitation by modeling alignment as a preference game and targeting a Nash equilibrium rather than a reward maximizer. However, the learning-theoretic foundations...
Expert Merging in Sparse Mixture of Experts with Nash Bargaining
arXiv:2510.16138v2 Announce Type: replace Abstract: Existing expert merging strategies for Sparse Mixture of Experts (SMoE) typically rely on input-dependent or input-independent averaging of expert parameters, but often lack a principled weighting mechanism. In this work, we reinterpret expert merging through the lens of game theory, revealing cooperative and competitive dynamics among experts. Based on this perspective, we introduce Nash Merging of Experts (NAMEx), a novel framework that...
Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
arXiv:2508.11874v2 Announce Type: replace Abstract: Designing polynomial-time algorithms for approximate Nash equilibria (ANE) with provable worst-case guarantees is a fundamental open problem in algorithmic game theory. While large language models (LLMs) can generate candidate algorithms at scale, certifying worst-case guarantees requires formal analysis over all game instances -- a task for which no automated system previously existed. Here, we present LegoNE, a framework encoding expert...
A Sheaf Framework for Strategic Multi-Agent Systems: From Consensus to Nash Equilibria
arXiv:2606.01663v1 Announce Type: new Abstract: The coordination of heterogeneous autonomous agents in dynamic, adversarial environments requires simultaneous satisfaction of geometric constraints, logical consistency, temporal reasoning, and strategic optimization. Existing sheaf- and topos-theoretic frameworks provide powerful tools for geometric consensus, knowledge alignment, and causal planning, but lack explicit models for value, reward, and strategic choice. This report presents a...
DNQ: Deep Nash Q-Network for Partially Observable n-Player Games
arXiv:2606.06480v1 Announce Type: new Abstract: Many real-world competitive systems require multiple decision-makers to act simultaneously under shared constraints, limited information, and repeated interaction, as in auctions, resource allocation, and security competition. We study multi-turn simultaneous bidding as a controlled testbed for such problems and propose DNQ, a solver-in-the-loop equilibrium supervision framework for training bidding agents. DNQ alternates between trajectory...
Game connectivity and adaptive dynamics in many-action games
arXiv:2601.05965v2 Announce Type: replace-cross Abstract: We study the typical structure of games in terms of their connectivity properties. A game is `connected' if it has a pure Nash equilibrium and there is a best-response path from every action profile which is not a pure Nash equilibrium to every pure Nash equilibrium; a game is generic if it has no indifferences. In previous work we showed that, among all $n$-player $k$-action generic games that admit a pure Nash equilibrium, the...
Colin Matthews: Seascapes album review – the songs teem with detail
Nash Ensemble/Booth/Farnsworth/Cottis(Onyx)Soprano Claire Booth and baritone Marcus Farnsworth celebrate the influential British composer’s kaleidoscopic soundworld with this collection of four song cycles It’s hard to think of a single figure who has been so influential on contemporary UK classical music for so long as Colin Matthews, who turned 80 earlierthis year. This release from the Nash Ensemble, conducted by Jessica Cottis, showcases his works for voice and chamber group. What’s...
Generalized binary utility functions and fair allocations
arXiv:2109.08461v2 Announce Type: replace Abstract: The problem of finding envy-free allocations of indivisible goods can not always be solved; therefore, it is common to study some relaxations such as envy-free up to one good (EF1). Another property of interest for efficiency of an allocation is the Pareto Optimality (PO). Under additive utility functions, it is possible to find allocations EF1 and PO using Nash social welfare.
Fairness in two-player zero-sum games with bandit feedback
Announce Type: new Abstract: We study two-player zero-sum games (TPZSGs) with bandit feedback under fairness constraints requiring every action to be played with probability at least $\alpha/m$. Existing instance-dependent results target $\textit{pure}$ Nash equilibria, while fairness generically produces $\textit{mixed}$ equilibria, a harder learning target. Our key technical tool is a reparametrization: every fair strategy decomposes as $p = (\alpha/m)\mathbf{1} + (1-\alpha)\widetilde{p}$...