arXiv (All)
open access
Cooperative Integer Programming Games: Core Stability and Optimal Coalition Structures
We introduce cooperative integer programming games (CIPGs), in which agents pool budget constraints to accomplish indivisible tasks jointly and the characteristic function maps every coalition to the optimal value of a pooled integer program. Our goal is to identify an optimal coalition structure (O
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
- Bidding graph games with partially-observable budgets#384950
- 16 U.S.C. § 284d — Cooperative agreement with Foundation for presentation of programs#572419
- A Minimax Perspective on Almost-Stable Matchings#924494
- A Minimax Perspective on Almost-Stable Matchings#920263
- A Game Theoretic Approach for Optimizing Quantum Error Budget Distribution#31341
Record · ID 998669
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