We survey different models, techniques, and some recent results to tackle machine scheduling problems within a distributed setting. In traditional optimization, a central authority is asked to solve a (computationally hard) optimization problem. In contrast, in distributed settings there are several agents, possibly equipped with private information that is not publicly known, and these agents must interact to derive a solution to the problem. Usually the agents have their individual preferences, which induces them to behave strategically to manipulate the resulting solution. Nevertheless, one is often interested in the global performance of such systems. The analysis of such distributed settings requires techniques from classical optimization, game theory, and economic theory. The paper therefore briefly introduces the most important of the underlying concepts and gives a selection of typical research questions and recent results, focusing on applications to machine scheduling problems. This includes the study of the so-called price of anarchy for settings where the agents do not possess private information, as well as the design and analysis of (truthful) mechanisms in settings where the agents do possess private information.
|Number of pages||18|
|Journal||Production and Operations Management|
|Publication status||Published - 1 Jan 2007|
Heydenreich, B., Müller, R. J., & Uetz, M. J. (2007). Games and Mechanism Design in Machine Scheduling - An Introduction. Production and Operations Management, 16(4), 437-454. https://doi.org/10.1111/j.1937-5956.2007.tb00271.x