arXiv (All)
open access
Settling the Complexity Landscape of Multi-Agent Contracts with Binary Actions
We study the computational complexity of optimal contract design in the multi-agent binary-action model, focusing on gross-substitutes reward functions and related classes. While additive rewards admit an FPTAS and general submodular rewards admit only constant-factor approximation, the complexity w
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Theoretical Considerations of Potential-Based Reward Shaping for Multi-Agent Systems#638157
- Multi-Principal Competition for an Exclusive Agent: characterization and approximation of Nash Equilibria#927716
- Optimally stubborn: how long to hold and who will fold?#1146548
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- Engineering Simplicity: Simple Mechanism Interfaces Steer LLM Agents#1131207
Record · ID 1128924
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive