Scheduling with Time Dependent Utilities: Fairness and Efficiency
arXiv:2603.28800v1 Announce Type: cross Abstract: A new class of multi agent single machine scheduling problems is introduced, where each job is associated with a self interested agent with a utility function decreasing in completion time. We aim to achieve a fair solution by maximizing the minimum utility across all agents. We study the problem's complexity and propose solution methods for several variants. For the general case, we present a binary search procedure to find the largest possible minimum utility, as well as an exact greedy based alternative. Variants with release and due dates are analyzed, showing strong NP hardness for arbitrary release dates, but weak NP hardness for a single release date job, and polynomial solvability when all jobs share processing times. For all these
View PDF HTML (experimental)
Abstract:A new class of multi agent single machine scheduling problems is introduced, where each job is associated with a self interested agent with a utility function decreasing in completion time. We aim to achieve a fair solution by maximizing the minimum utility across all agents. We study the problem's complexity and propose solution methods for several variants. For the general case, we present a binary search procedure to find the largest possible minimum utility, as well as an exact greedy based alternative. Variants with release and due dates are analyzed, showing strong NP hardness for arbitrary release dates, but weak NP hardness for a single release date job, and polynomial solvability when all jobs share processing times. For all these cases we also study the corresponding problem of finding efficient solutions where the sum of utilities is maximized. We also examine settings where linear utility functions can be adjusted within budget constraints, exploring the impact on optimal schedules when intercepts or slopes are modified. From a single agent perspective, we investigate the effect of improving one agent's utility in the overall solution. Adding a new job to be inserted with the best possible utility gives rise to rescheduling problems, where different lower bounds depending on the utilities of the original fair schedule are imposed. Finally, we consider a bi level setting where a leader wants to enforce a certain target schedule by modifying utility functions while the follower computes a fair solution for the modified instance. Our work contributes to scheduling theory, multi agent systems, and algorithmic fairness, highlighting fairness oriented objectives in competitive scheduling.
Subjects:
Computer Science and Game Theory (cs.GT); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS); Multiagent Systems (cs.MA)
MSC classes: 68Q25
ACM classes: G.2.1; F.2.2
Cite as: arXiv:2603.28800 [cs.GT]
(or arXiv:2603.28800v1 [cs.GT] for this version)
https://doi.org/10.48550/arXiv.2603.28800
arXiv-issued DOI via DataCite
Submission history
From: Andrea Pacifici [view email] [v1] Thu, 26 Mar 2026 14:31:25 UTC (961 KB)
Sign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
releaseannounceperspective
The Fallback That Never Fires
<p>Your agent hits a rate limit. The fallback logic kicks in, picks an alternative model. Everything should be fine.</p> <p>Except the request still goes to the original model. And gets rate-limited again. And again. Forever.</p> <h2> The Setup </h2> <p>When your primary model returns 429:</p> <ol> <li>Fallback logic detects rate_limit_error</li> <li>Selects next model in the fallback chain</li> <li>Retries with the fallback model</li> <li>User never notices</li> </ol> <p>OpenClaw has had model fallback chains for months, and they generally work well.</p> <h2> The Override </h2> <p><a href="https://github.com/openclaw/openclaw/issues/59213" rel="noopener noreferrer">Issue #59213</a> exposes a subtle timing problem. Between steps 2 and 3, there is another system: <strong>session model recon
Integral Ad Science Earns Prestigious Webby Finalist Nomination for its Generative AI Innovation, IAS Agent - businesswire.com
<a href="https://news.google.com/rss/articles/CBMi9gFBVV95cUxPTEdPUWVETURsWEh5WkVpbFBIbV80NEE4ckVBWmhUekxKLS1iY3R4bWRXM09tWFNjb3E3aENqcVNJSmhLdGhhZWhLRTlMM2dhX2xfYjMtRlIzTlZHNE1DSU9HWnRJeXV3dVo3SllBaklxd2FaWGdXNjYxMC01SVhOQ3RyQ2taQjVjbXoxLTVnSWFXNzFlOVFHRlgxOWVGa2tJa0xCQXFZVGs0OGtkZHpEa3Bfb0c1M0wtZG5jUXVSZ2RTMWlHTGR1dTlYcEJtMlBtYWxTTlc2VXlxUzdTd0dRWjJqOFg0ODgwTmNHTVhMalRXQkVKbXc?oc=5" target="_blank">Integral Ad Science Earns Prestigious Webby Finalist Nomination for its Generative AI Innovation, IAS Agent</a> <font color="#6f6f6f">businesswire.com</font>
How We Built an EdTech Platform That Scaled to 250K Daily Users
<p>In 18 months, we took an EdTech platform from a founder's wireframe to 250,000 daily active users. The app handles 2,000+ concurrent video streams, processes 50,000 quiz submissions per hour, and runs on a $4,200/month infrastructure bill.</p> <p>Here's what we built, what broke, and what we'd do differently.</p> <h2> The Problem We Were Solving </h2> <p>The founder wanted CA exam preparation for 500K+ students. Existing platforms were either expensive (Unacademy at $200+/year) or had poor UX. The brief: live classes, recorded lectures, AI-powered quizzes, and doubt resolution — all at a $50/year price point.</p> <p>Budget: $40K for MVP. Timeline: 12 weeks.</p> <h2> The Architecture That Made It Work </h2> <p>We didn't overthink the stack. We picked proven tools and focused on shipping.
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Releases
Roguelike Devlog: Redesigning a Game UI With an AI 2D Game Maker
<p>Sector Scavengers is a spacefaring extraction roguelike where each run feeds a larger civilization-building meta game. This week was all about solving a UI problem that kept getting worse the longer I ignored it: one hub trying to do too much.</p> <p>What I learned quickly is that running both game modes through a single central hub was making both of them worse. Here is how I used Makko to work through it.</p> <h2> When One Screen Tries to Do Everything </h2> <p>My meta progression systems — crew advancement, station building, hardware research, void powers, and card unlocks — were all living in the same HUD as the controls for individual Expedition runs. On paper it sounded efficient. In practice it created a serious information architecture problem.</p> <p>The deeper I got into it, t
Shaping the UAE’s Digital Destiny: Building Sovereignty, Trust, and Resilience in the Cyber Era
Q. With the increasing reliance on digital infrastructure, how is the UAE addressing digital sovereignty to protect its critical assets and data from external threats? Lt. Colonel Saeed M. Al Shebli: Digital sovereignty, in my view, is no longer a technical concept; it’s a cornerstone of national independence and strategic stability. The UAE has been remarkably […] The post Shaping the UAE’s Digital Destiny: Building Sovereignty, Trust, and Resilience in the Cyber Era appeared first on EE Times . ]]>
Google's Veo 3.1 Lite Cuts API Costs in Half as OpenAI's Sora Exits the Market - Decrypt
<a href="https://news.google.com/rss/articles/CBMigwFBVV95cUxNTUZwMV9zbEhmbXlJcUNDdDZEckRyZTZBV3RLWnQ4Yk1pd3ZuT2pqNkhsQ3RVQTdsZWNnZUlFaXhnQUFlbGZPbVJWMnpVUHRIdE45UXlCZW5kZzdiaEljSVlPcXlPeVM4M25UbVp3c2RtdHpzUmVydmR3eWhsQ3Vfa19nRdIBiwFBVV95cUxPcTZkSE9ZSzFyUXR5bWdvc2VCXzlEVVBxemRTb3Q5ZDVJTlkyMW9qdDdPRnVyMkgzZmpnbmpaXzBLbE5KX2g0N216aWxqdmpjYU5RMm5rQ21wN1NxVllpMnNZU2szVFFKNlp1c0tZQ0N2WGVhQ0dqczJ4azI1Vmd3YzVvem1jRkRxYlRz?oc=5" target="_blank">Google's Veo 3.1 Lite Cuts API Costs in Half as OpenAI's Sora Exits the Market</a> <font color="#6f6f6f">Decrypt</font>
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!