arXiv (OAI Expanded)
open access
Consistency-Robustness Tradeoffs for Strategyproof Scheduling with Predictions
We study strategyproof scheduling on \(n\) unrelated machines with predictions. Each machine is controlled by an agent with privately known processing times, while the mechanism receives a public prediction of the processing-time matrix before the agents report. The objective is to minimize the make
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
- TFR-GNN: Topology- and Fault-Aware Graph Neural Scheduling for Heterogeneous Distributed Computing Systems#986938
- Robust scheduling with stochastic processing times in flexible job-shops#1166361
- TRACE: Tackling Real-World Resource Assignment Problems via Agentic Heuristic Design#1157158
- Modelstamp: Pre-Deserialization Verification of Machine-Learning Artifacts and Runtime Environment State#822208
- CPR-IE:A Compression-Prediction-Resource Intelligence Efficiency Metric#971475
Record · ID 1083562
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