PulseAugur
EN
LIVE 10:58:28
ENTITY Nash Social Welfare

Nash Social Welfare

PulseAugur coverage of Nash Social Welfare — every cluster mentioning Nash Social Welfare across labs, papers, and developer communities, ranked by signal.

Show in brief
Total · 30d
2
6 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
2
6 over 90d
TIER MIX · 90D
TOPICS
RECENT · PAGE 1/1 · 6 TOTAL
  1. RESEARCH · CL_280429 ·

    New research on arXiv explores bandit algorithms, adversarial attacks, and non-stationarity

    Multiple research papers published on arXiv explore advancements in bandit algorithms, focusing on theoretical bounds, adversarial attacks, and non-stationary environments. One paper establishes a general lower bound fo…

  2. RESEARCH · CL_267503 ·

    New methods tackle multi-dimensional matching problems for AI applications · 3 sources tracked

    Researchers have developed new methods for multi-dimensional matching problems, which are crucial for aligning structured objects and distributions. One approach, detailed in a paper submitted on September 24, 2026, use…

  3. TOOL · CL_235623 ·

    New AI framework PriorityNet optimizes resource allocation with EF1 and NSW

    Researchers have developed a deep reinforcement learning framework called PriorityNet to address the allocation of indivisible goods while satisfying envy-freeness up to one good (EF1) and maximizing Nash social welfare…

  4. TOOL · CL_233391 ·

    New algorithm balances fairness and stability in matching problems

    Researchers have developed a new algorithm, SNSW-Alg, designed to address fairness in stable matching problems. This algorithm aims to maximize Nash Social Welfare, a measure of fairness, while maintaining the stability…

  5. TOOL · CL_49332 ·

    New SVD method simplifies multi-dimensional matching markets

    Researchers have developed a novel, computationally efficient mechanism for multi-dimensional matching markets. This new approach uses Singular Value Decomposition (SVD) to simplify complex preference matching into a on…

  6. RESEARCH · CL_16066 ·

    Researchers explore dueling bandits for robust context, fairness, and unknown delays

    Two new research papers explore advancements in dueling bandit algorithms, a technique used in machine learning for preference data. The first paper addresses challenges like unknown delays and adversarial corruptions i…