arXiv (OAI Expanded)
open access
An Algorithm-to-Contract Framework without Demand Queries
Consider costly and time-consuming tasks that add up to the success of a project, and must be fitted into a given time-frame. This is an instance of the classic budgeted maximization (knapsack) problem, which admits an FPTAS. Now assume an agent is performing these tasks on behalf of a principal, wh
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
- Family_Winner: Integrating Game Theory and Heuristics to Provide Negotiation Support#203240
- An Approximation Algorithm for Monotone Submodular Cost Allocation#1012077
- The optimist#62279
- Combinatorial Optimization#66996
- A behavioral approach to meeting contingency contracting personnel requirements#497117
Record · ID 1084044
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