Scheduling Tasks with Precedence Constraints to Solicit Desirable Bid Combinations

Alexander Babanov, John Collins, Maria L Gini

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach is based on Expected Utility Theory. In this paper we address two mutually dependent questions: (a) what are the properties of the problem domain that can facilitate efficient maximization algorithms, and (b) what criteria determine attractiveness of one or another potential solution to the agent. We discuss different ways of exploring the problem domain. We show that naive optimization approaches often fail to find solutions for risk-averse agents and propose ways of using properties of the domain to improve upon naive approaches.

Original languageEnglish (US)
Title of host publicationProceedings of the Second International Joint Conference on Autonomous Agents and multiagent Systems, AAMAS 03
EditorsJ.S. Rosenschein, T. Sandholm, M. Wooldridge, M. Yakoo
Pages345-352
Number of pages8
Volume2
StatePublished - Dec 1 2003
EventProceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 - Melbourne, Vic., Australia
Duration: Jul 14 2003Jul 18 2003

Other

OtherProceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03
CountryAustralia
CityMelbourne, Vic.
Period7/14/037/18/03

Keywords

  • Automated auctions
  • Expected utility
  • Multi-agent contracting
  • Risk estimation

Fingerprint Dive into the research topics of 'Scheduling Tasks with Precedence Constraints to Solicit Desirable Bid Combinations'. Together they form a unique fingerprint.

Cite this