Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1807406.1807467acmotherconferencesArticle/Chapter ViewAbstractPublication PagesbqgtConference Proceedingsconference-collections
research-article

On the complexity of equilibria in markets with additively separable utilities

Published: 14 May 2010 Publication History

Abstract

We show that the problem of computing an approximate Arrow-Debreu market equilibrium is PPAD-hard, even when all traders use additively separable, piecewise-linear, and concave utility functions. We will also discuss the extension of this result to Fisher's model.

Cited By

View all
  • (2021)Settling the complexity of Nash equilibrium in congestion gamesProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451039(1426-1437)Online publication date: 15-Jun-2021
  • (2012)Can the Theory of Algorithms Ratify the “Invisible Hand of the Market”?Computer Science – Theory and Applications10.1007/978-3-642-30642-6_1(1-5)Online publication date: 2012

Index Terms

  1. On the complexity of equilibria in markets with additively separable utilities

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    BQGT '10: Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
    May 2010
    155 pages
    ISBN:9781605589190
    DOI:10.1145/1807406
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    • Eller College of Management

    In-Cooperation

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 14 May 2010

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article

    Conference

    BQGT '10
    Sponsor:

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 23 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Settling the complexity of Nash equilibrium in congestion gamesProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451039(1426-1437)Online publication date: 15-Jun-2021
    • (2012)Can the Theory of Algorithms Ratify the “Invisible Hand of the Market”?Computer Science – Theory and Applications10.1007/978-3-642-30642-6_1(1-5)Online publication date: 2012

    View Options

    View options

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media