cs.MA · 2026-08-19 · No. 89

Multiagent Systems, 2026-08-19.

2 new papers in cs.MA. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

2 entries
  1. 01

    Collective Counterfactual Planning: Coordination, Consent, and Verification under Representational Constraints

    Chainarong Amornbunchornvej

    cs.MA · cs.AI

    Groups routinely complete projects that no single member can plan, execute, or verify alone. We propose a formal model of this phenomenon, Collective Counterfactual Planning (CCP), in which the binding limitation on each agent is neither capability, knowledge, nor observability, but representational geometry: each agent perceives the state, conceives moves, consents to actions, and certifies goal requirements only through a projection onto an...

    arxiv.org/abs/2608.17932 · PDF

  2. 02

    A Theoretical Framework for Parallel Lifelong MAPF Using Group Decentralized Planning

    Alex DeWeese, Jiaoyang Li, Guannan Qu

    cs.MA · cs.AI · cs.RO

    In the Lifelong Multi-Agent Path Finding (L-MAPF) problem, agents must repeatedly move from one destination to another while avoiding obstacles and inter-agent collisions. Widely regarded as one of the highest-performing solutions to this problem is the Rolling-Horizon Collision Resolution (RHCR) framework. However, commensurate with its quality solutions, it incurs a computational cost that limits its applicability to even modest agent...

    arxiv.org/abs/2608.17928 · PDF

This edition is part of The Daily Abstract — cs.MA archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.