skip to main content
10.1145/545056.545123acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

Task selection problem under uncertainty as decision-making

Published:15 July 2002Publication History

ABSTRACT

In this paper, we address the problem of decision-making under uncertainty for the task selection problem. We consider an environment where an agent has to select tasks to execute in a way which maximizes his gain. The main motivation is the new challenging applications such as planetary rovers, e-commerce, combinatorial auction and vehicle routing where agents are with limited resources and have to distribute and execute a set of tasks under uncertainty. In the model proposed in this paper, we formulate the local task selection as a \textitMarkov Decision Process (MDP). In fact, the MDP allows agents to deal with two sources of uncertainty : (1) the uncertainty on the task allocation, and (2) the uncertainty on the consumption of resources required for executing each task. We will also show how an agent can improve his knowledge about the environment.

References

  1. M.R. Andersson and T.W Sandholm. Contract types for satisficing task allocation: 2 experimental results. In Proceedings of AAAI 1998 Spring Symposium: Satisficing Models, pages 1--7, Stanford University, CA, Mar 1998.Google ScholarGoogle Scholar
  2. Martin Andersson and Tuomas Sandholm. Time-quality tradeoffs in reallocative negotiation with combinatorial contract types. In Proceedings of AAAI 99, pages 3--10, jul 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. R. E. Bellman. Dynamic programming, princeton university press, princeton. 1957a. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. E. Bellman. A markov decision process. journal of Mathematical Mechanics, pages 6:679--684, 1957b.Google ScholarGoogle Scholar
  5. Carig Boutilier, Moisés Goldszmidt, and Bikash Sabata. Sequential auction for the allocation of resources with complementarities. In Proceedings of IJCAI 99, Stockholm, volume 1, pages 527--534, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Maroua Bouzid, Hosam Hanna, and Abdel-Illah Mouaddib. Balancing Reactivity and Social Deliberation in Multi-Agent Systems, chapter Controlled Social Deliberation : Deliberation Levels in Theoretic-Decision Approaches for Task Allocation in Resource-Bounded Agents, pages 198--216. LNAI 2103. Springer-Verlag Berlin Heidelberg, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. T. Estlin, A. Tobias, G. Rabideau, R. Castana, and E. Mjolsness. An integrated system for multi-rever scientific exploration. In Proceedings of AAAI 99, pages 613--613, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. White D. J. Markov Decision Processes. West Sussesx, England : John Wiley & Sons, 1993.Google ScholarGoogle Scholar
  9. M. L. Puterman. Markov decision processes. Wiley, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  10. M.H. Rothkopf, A. Pekec, and R.M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131--1147, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Tuomas Sandholm. emediator: A next generation electronic commerce server. In International Conference on Autonomous Agents (AGENTS), Barcelona, Spain, jun 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Task selection problem under uncertainty as decision-making

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          AAMAS '02: Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
          July 2002
          451 pages
          ISBN:1581134800
          DOI:10.1145/545056

          Copyright © 2002 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 15 July 2002

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate1,155of5,036submissions,23%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader