Fair imposition

  • Authors:
  • Yoav Shoham;Moshe Tennenholtz

  • Affiliations:
  • Computer Science Department, Stanford University, Stanford, CA;Faculty of Industrial Engineering and Management, Technion, Haifa, Israel and Computer Science Department, Stanford University, Stanford, CA

  • Venue:
  • IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce a new notion, related to auctions and mechanism design, called fair imposition. In this setting a center wishes to fairly and efficiently allocate tasks among a set of agents, not knowing their cost structure. As in the study of auctions, the main abstacle to overcome is the self-interest of the agents, which will in general cause them to hide their true costs. Unlike the auction setting, however, here the center has the power to impose arbitrary behavior on the agents, and furthermore wishes to distribute the cost as fairly as possible among them. We define the problem precisely, present solution criteria for these problems (the central of which is called k-efficiency), and present both positive results (in the form of concrete protocols) and negative results (in the form of impossibility theorems) concerning these criteria.