SIGN: Schema-Induced Games for Naming
Ryan Zhang, Herbert Woisetschl\"ager

TL;DR
SIGN demonstrates that minimal schema-induced structure in communication protocols significantly accelerates convergence and improves agreement among language model agents, enhancing coordination efficiency in multi-agent systems.
Contribution
The paper introduces Schema-Induced Games for Naming (SIGN), a novel framework showing how lightweight structure guides faster and more consistent convention formation among AI agents.
Findings
Faster convergence with schema-induced communication
Up to 5.8x higher agreement compared to natural language
Minimal structure acts as an effective control for coordination
Abstract
Real-world AI systems are tackling increasingly complex problems, often through interactions among large language model (LLM) agents. When these agents develop inconsistent conventions, coordination can break down. Applications such as collaborative coding and distributed planning therefore require reliable, consistent communication, and scalability is a central concern as systems grow. We introduce Schema-Induced Games for Naming (SIGN), a naming game that examines how lightweight structure can steer convention formation. We compare schema-induced communication to unconstrained natural language and find faster convergence with up to 5.8x higher agreement. These results suggest that minimal structure can act as a simple control knob for efficient multi-agent coordination, pointing toward broader applications beyond the naming game.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
