Characterization and computation of equilibria for indivisible goods

Simina Brânzei, Hadi Hosseini, Peter Bro Miltersen

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations

    Abstract

    We consider the problem of allocating indivisible goods using the leading notion of fairness in economics: the competitive equilibrium from equal incomes. Focusing on two major classes of valuations, namely perfect substitutes and perfect complements, we establish the computational properties of algorithms operating in this framework. For the class of valuations with perfect complements, our algorithm yields a surprisingly succinct characterization of instances that admit a competitive equilibrium from equal incomes.

    Original languageEnglish (US)
    Title of host publicationAlgorithmic Game Theory - 8th International Symposium, SAGT 2015
    EditorsMartin Hoefer, Martin Hoefer
    PublisherSpringer Verlag
    Pages244-255
    Number of pages12
    ISBN (Print)9783662484326
    DOIs
    StatePublished - 2015
    Event8th International Symposium on Algorithmic Game Theory, SAGT 2015 - Saarbrucken, Germany
    Duration: Sep 28 2015Sep 30 2015

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9347
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference8th International Symposium on Algorithmic Game Theory, SAGT 2015
    Country/TerritoryGermany
    CitySaarbrucken
    Period9/28/159/30/15

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Characterization and computation of equilibria for indivisible goods'. Together they form a unique fingerprint.

    Cite this