Cooperative Negotiation in Autonomic Systems using Incremental Utility Elicitation
Craig Boutilier, Rajarshi Das, Jeffrey O. Kephart, Gerald Tesauro,, William E. Walsh

TL;DR
This paper presents a method for decentralized resource allocation in large-scale autonomic systems using incremental utility elicitation, enabling efficient and near-optimal negotiation without exhaustive utility computation.
Contribution
It introduces an incremental utility elicitation technique for cooperative negotiation, reducing computational costs while achieving near-optimal resource allocations.
Findings
Near-optimal allocations achieved with limited utility sampling
Incremental elicitation reduces computational overhead
Preliminary experiments demonstrate effectiveness
Abstract
Decentralized resource allocation is a key problem for large-scale autonomic (or self-managing) computing systems. Motivated by a data center scenario, we explore efficient techniques for resolving resource conflicts via cooperative negotiation. Rather than computing in advance the functional dependence of each element's utility upon the amount of resource it receives, which could be prohibitively expensive, each element's utility is elicited incrementally. Such incremental utility elicitation strategies require the evaluation of only a small set of sampled utility function points, yet they find near-optimal allocations with respect to a minimax regret criterion. We describe preliminary computational experiments that illustrate the benefit of our approach.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Game Theory and Applications · Distributed systems and fault tolerance
