Fair linking mechanisms for resource allocation with correlated player types Articles uri icon

publication date

  • August 2016

start page

  • 777

end page

  • 801

issue

  • 8

volume

  • 98

international standard serial number (ISSN)

  • 0010-485X

electronic international standard serial number (EISSN)

  • 1436-5057

abstract

  • Resource allocation is one of the most relevant problems in the area of Mechanism Design for computing systems. Devising algorithms capable of providing efficient and fair allocation is the objective of many previous research efforts. Usually, the mechanisms they propose deal with selfishness by introducing utility transfers or payments. Since using payments is undesirable in some contexts, a family of mechanisms without payments is proposed in this paper. These mechanisms extend the Linking Mechanism of Jackson and Sonnenschein introducing a generic concept of fairness with correlated preferences. We prove that these mechanisms have good incentive, fairness, and efficiency properties. To conclude, we provide an algorithm, based on the mechanisms, that could be used in practical computing environments.

keywords

  • resource allocation; task allocation; linking mechanism; fairness; player correlation; ad-hoc networks; game-theory; transform