1 Citation (SciVal)

Abstract

We study the connection between the direction preserving zero point and the discrete Brouwer fixed point in terms of their computational complexity. As a result, we derive a PPAD-completeness proof for finding a direction preserving zero point, and a matching oracle complexity bound for computing a discrete Brouwer's fixed point. Building upon the connection between the two types of combinatorial structures for Brouwer's continuous fixed point theorem, we derive an immediate proof that TUCKER is PPAD-complete for all constant dimensions, extending the results of Pálvölgyi for 2D case [20] and Papadimitriou for 3D case [21]. In addition, we obtain a matching algorithmic bound for TUCKER in the oracle model.

Original languageEnglish
Title of host publicationInternet and Network Economics - 5th International Workshop, WINE 2009, Proceedings
EditorsS. Leonardi
Place of PublicationBerlin, Germany
PublisherSpringer Berlin
Pages410-421
Number of pages12
ISBN (Electronic)9783642108419
ISBN (Print)9783642108402
DOIs
Publication statusPublished - 31 Dec 2009
Event5th International Workshop on Internet and Network Economics, WINE 2009 - Rome, Italy
Duration: 14 Dec 200918 Dec 2009

Publication series

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

Conference

Conference5th International Workshop on Internet and Network Economics, WINE 2009
Country/TerritoryItaly
CityRome
Period14/12/0918/12/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Direction preserving zero point computing and applications'. Together they form a unique fingerprint.

Cite this