A selfish allocation heuristic in scheduling: Equilibrium and inefficiency bound analysis

Jac Braat, Herbert Hamers, F. Klijn, M. Slikker

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Abstract

For single decision maker optimization problems that lack time efficient algorithms to determine the optimum, there is a need for heuristics. In the context of coordinated production planning, the seminal paper of Graham (1969) provided a performance analysis of heuristics and obtained a bound in relation to the centralized optimum.

This paper introduces a framework that includes a performance analysis of a so-called equilibrium heuristic in the setting of multiple decision maker problems. The framework consists of three steps: a heuristic for each player that leads to a strategy profile, the verification that this strategy profile is a Nash equilibrium, and finally a worst case cost analysis to obtain a bound on the performance of the heuristic in terms of the aggregate cost in the obtained Nash equilibrium in relation to the centralized optimum.

We implement our general framework in a setting of sequencing situations with selfish agents, multiple identical machines, and the sum of completion times as cost criterion. We provide a tight upper bound for the performance of our equilibrium heuristic. Simulations show that the equilibrium heuristic generally performs much better than the derived tight upper bound. Finally, the relation with the price of anarchy is discussed.
Original languageEnglish
Pages (from-to)634-645
JournalEuropean Journal of Operational Research
Volume273
Issue number2
DOIs
Publication statusPublished - Mar 2019

Keywords

  • game theory
  • sequencing situations
  • outsourcing
  • equilibrium
  • heuristic

Fingerprint Dive into the research topics of 'A selfish allocation heuristic in scheduling: Equilibrium and inefficiency bound analysis'. Together they form a unique fingerprint.

Cite this