most citedMastering Board Games by External and Internal Planning with Language Models

2 citations · 2 across the 6 of their papers we have counts for

collaborators

8 papers

cs.GT2026

Decentralized LLM Workflows via Sequential Auctions

Ian Gemp, Shubhendu Trivedi, Adam Fisch +7

We present a scalable framework for solving multi-step tasks through a decentralized market of self-interested agents. Prior theoretical work demonstrated that agents organized thr…

cs.LG2026

Your Transformer Is Secretly Elastic

Walter Simoncini, Dheeraj Varghese, Gertjan J. Burghouts +1

Scaling up transformers has produced models with broad capabilities, deployed across heterogeneous hardware and fluctuating workloads. Yet, model families offer only a few fixed si…

cs.AI2026

Pandora's AI Model Routing Box: Efficient Allocation with Costly Value Estimation

Adam Fisch, Shubhendu Trivedi, Fantine Huot +5

Heterogeneous AI systems composed of multiple models, architectures, harnesses, or inference-time settings can improve quality and efficiency by routing queries to the specialist w…

cs.MA2026

When is Routing Meaningful? Diversity and Robustness in Language Model Societies

Fantine Huot, Michael Kaisers, Mirella Lapata

Routing policies for multi-model systems are evaluated almost exclusively on task accuracy and inference cost. We argue that two properties, orthogonal to performance, determine wh…

cs.AI2026

Active Evaluation of General Agents: Problem Definition and Comparison of Baseline Algorithms

Marc Lanctot, Kate Larson, Ian Gemp +1

As intelligent agents become more generally-capable, i.e. able to master a wide variety of tasks, the complexity and cost of properly evaluating them rises significantly. Tasks tha…

cs.AI2024★ 2 cited

Mastering Board Games by External and Internal Planning with Language Models

John Schultz, Jakub Adamek, Matej Jusup +13

Advancing planning and reasoning capabilities of Large Language Models (LLMs) is one of the key prerequisites towards unlocking their potential for performing reliably in complex a…

cs.MA2024

Soft Condorcet Optimization for Ranking of General Agents

Marc Lanctot, Kate Larson, Michael Kaisers +7

Driving progress of AI models and agents requires comparing their performance on standardized benchmarks; for general agents, individual performances must be aggregated across a po…

cs.GT2024

Approximating the Core via Iterative Coalition Sampling

Ian Gemp, Marc Lanctot, Luke Marris +11

The core is a central solution concept in cooperative game theory, defined as the set of feasible allocations or payments such that no subset of agents has incentive to break away…