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

Applying a combinatorial auction protocol to a coalition formation among agents in complex problems

Authors Info & Claims
Published:14 July 2003Publication History

ABSTRACT

We are trying to apply a combinatorial auction protocol to a coalition formation among agents to solve a scheduling problem that considers various constraints as a complex problem. Constraints on scheduling can be expressed as combinations of items (time slots). We formalize a combinatorial auction for scheduling as an MIP (Mixed Integer Programming) problem, which integrates the constraints on items and bids to express complex problems.

References

  1. A. Anderson, M. Tenhunen, and F. Ygge. Integer programming for combinatorial auction winner determination. In Proceedings of the 4th International Conference on Multi-Agent Systems (ICMAS2000), pages 39--46, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 607--613, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Applying a combinatorial auction protocol to a coalition formation among agents in complex problems

          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 '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems
            July 2003
            1200 pages
            ISBN:1581136838
            DOI:10.1145/860575

            Copyright © 2003 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: 14 July 2003

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • Article

            Acceptance Rates

            Overall Acceptance Rate1,155of5,036submissions,23%
          • Article Metrics

            • Downloads (Last 12 months)2
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader