Auction protocols for decentralized scheduling (Q5938627)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1623173
Language Label Description Also known as
default for all languages
No label defined
    English
    Auction protocols for decentralized scheduling
    scientific article; zbMATH DE number 1623173

      Statements

      Auction protocols for decentralized scheduling (English)
      0 references
      0 references
      0 references
      0 references
      30 July 2002
      0 references
      Decentralized scheduling is the problem of allocating resources to alternative possible uses over time, where competing uses are represented by autonomous agents. Market mechanisms use prices derived through distributing bidding protocols to determine schedules. The authors investigate the existence of equilibrium prices for some general classes of scheduling problems, the quality of equilibrium solutions, and the behavior of an ascending auction mechanism and bidding protocol. To remedy the potential nonexistence of price equilibria due to complementarities in preference they introduce additional markets in combinations of basis goods. Finally, they consider direct revelation mechanisms and compare to the market-based approach.
      0 references
      auction protocol
      0 references
      decentralized scheduling
      0 references
      autonomous agents
      0 references
      existence of equilibrium prices
      0 references
      quality of equilibrium solutions
      0 references

      Identifiers