• DocumentCode
    2378631
  • Title

    Bidding without pricing: An iterative bidding mechanism for scheduling non-commercial services

  • Author

    Wang, Chun

  • Author_Institution
    Concordia Inst. for Inf. Syst. Eng., Concordia Univ., Montreal, QC, Canada
  • fYear
    2011
  • fDate
    9-12 Oct. 2011
  • Firstpage
    1020
  • Lastpage
    1025
  • Abstract
    This paper presents an iterative bidding mechanism for scheduling non-commercial services provided by publicly funded scientific facilities, healthcare systems, government agencies, and many other not-for-profit organizations. In non-commercial service scheduling problems, service providers strive to maximize the common welfare of the community through effective scheduling of their services and, at the same time, customers may behave strategically to achieve their individual objectives by not revealing their complete availabilities. This misalignment of objectives between the service provider and the customers leads naturally to the design of market-based scheduling mechanisms. A unique challenge in this non-commercial setting is that monetary payments cannot be involved in the design of the mechanism. We propose a non-price iterative bidding framework which aligns customers´ self-interests with the service provider´s objective. In addition, the mechanism also accommodates customers´ personal preferences. We show that, under the proposed mechanism, myopic bidding is the dominant strategy for customers.
  • Keywords
    financial data processing; scheduling; iterative bidding mechanism; noncommercial services; pricing; scheduling mechanisms; Availability; Job shop scheduling; Optimal scheduling; Processor scheduling; Resource management; Schedules; auction; iterative bidding; multi-agent systems; multilateral negotiation; non-commercial services scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on
  • Conference_Location
    Anchorage, AK
  • ISSN
    1062-922X
  • Print_ISBN
    978-1-4577-0652-3
  • Type

    conf

  • DOI
    10.1109/ICSMC.2011.6083803
  • Filename
    6083803