On the Fair and Efficient Allocation of Indivisible Commodities.

Abstract

Auctions and fair division problems are situations in which commodities are to be allocated fairly and efficiently. While a variety of schemes exist for fairly allocating finely divisible homogeneous commodities, most schemes are not applicable to the problem of allocating indivisible items. This paper considers the problem of fairly allocation sets of indivisible objects. 'Dollars,' a finely divisible, homogeneous, transferrable commodity, are used to evaluate individuals preferences and to transfer value among individuals. This introduction of dollars has several implications; the main result is that fair allocation problems may be viewed as two smaller problems. First auction the goods among the individuals and then divide the resulting revenue according to the chosen definition of fairness. Several existing fair allocation schemes are reviewed; examples illustrate some difficulties associated with their use. Kuhn's definitions of 'fairness' are presented and two extensions are considered for the case where individuals have different shares in the collection of goods.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1977
Accession Number
ADA066727

Entities

People

  • Richard Engelbrecht-wiggans

Organizations

  • Cornell University College of Engineering

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Dynamic Programming
  • Economics
  • Game Theory
  • Government Procurement
  • Governments
  • Motivation
  • New York
  • Operations Research
  • Real Numbers
  • United States
  • Universities

Fields of Study

  • Economics

Readers

  • Economics
  • Graph Algorithms and Convex Optimization.
  • Theoretical Analysis.