Alem

Benchmarking Open-Ended Multi-Agent Coordination in Language Agents

arXiv:2606.08340v1 Announce Type: new Abstract: As language models are increasingly deployed as autonomous agents, they must coordinate with others over long horizons in open-ended interactive tasks. Yet existing evaluations rarely test these demands together, instead emphasising single-agent tasks, short interactions, or highly structured multi-agent settings. We introduce $alem$, a JAX-based benchmark for open-ended multi-agent coordination built on Craftax-like dynamics.

Britain's Sheeraz stops Begic in world title mismatch

Britain's Sheeraz stops Begic in world title mismatch

Britain's Sheeraz stops Begic in world title mismatch

Britain's Sheeraz stops Begic in world title mismatch

Britain's Sheeraz stops Begic in world title mismatch

Cyprus and Kazakhstan deepen ties with agreements, flights and investment plans

Five cooperation agreements were signed during the first visit by a Cypriot president to Kazakhstan. The talks focused on trade, investment, transport and digital development, while new direct flights and diplomatic initiatives aim to strengthen links between Europe and Central Asia. Cyprus and Kazakhstan signed five cooperation agreements and pledged to deepen economic ties during the first official visit by a Cypriot president to Kazakhstan, as the two countries opened embassies...

Dmitry Bivol reclaims top spot at light heavyweigh...

Dmitry Bivol returned to the rankings after a 15-month absence, reclaiming the No. 1 spot at light heavyweight with a dominant performance against Michael Eifert . The fight was less about the opponent and more about Bivol knocking the rust off with a one-sided victory that was never in doubt. After knocking down Eifert in the opening round with a left hook, Bivol remained in control to retain the WBA and IBF light heavyweight titles by unanimous decision.

Britain's Sheeraz stops Begic in world title mismatch

Pinning on Tight Cuts: Improved Algorithm and Bounds for Unsplittable Multicommodity Flows in Outerplanar Graphs

arXiv:2606.04456v1 Announce Type: new Abstract: The multicommodity flow problem in an undirected capacitated graph $G$ is specified by a set of source-sink pairs with nonnegative demands. A flow is feasible if it routes all demands without exceeding the edge capacities, and it is unsplittable if it routes each demand along a single path. Let $\alpha$ be the smallest value such that the existence of a feasible flow implies the existence of an unsplittable flow that exceeds the edge capacities...