cs.GT
PulseAugur coverage of cs.GT — every cluster mentioning cs.GT across labs, papers, and developer communities, ranked by signal.
3 day(s) with sentiment data
-
New algorithm offers quasipolynomial time solution for $\ell_\infty$ contractions
A new algorithm has been developed to compute an approximate fixed point for nonexpansions in $\ell_\infty$ norm. This algorithm achieves a runtime of $\log(1/\eps)^{O(\log^2 d)}$, which has implications for solving sim…
-
Cake cutting research tackles proportional allocation complexity · 2 papers
Two new research papers explore the complexities of proportional cake cutting, a theoretical problem in multiagent systems. The first paper determines the exact worst-case number of cuts needed to guarantee an equal-len…
-
New Poll algorithm offers efficient network intervention in strategic agent games
Researchers have developed a new algorithm called Poll for network intervention in multi-activity network games. This algorithm addresses challenges related to private information, potential misreporting by agents, and …
-
New framework models indirect geoeconomic influence via political economy restructuring
Researchers have developed a new framework using switching dynamical systems to analyze indirect geoeconomic influence. This model allows a sender to influence a target nation by restructuring its internal political eco…
-
AI alignment theory quantifies information loss with Bayesian persuasion bounds
Researchers have developed a theoretical framework to quantify AI alignment guarantees, focusing on Bayesian persuasion models. They established an upper bound of 3/2 for the ratio of maximum receiver utility to baselin…