SIAMCOMP 2010 - PDF Preprint Papers

SIAMCOMP 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SIAMCOMP-2010 Paper

click to vote

SIAMCOMP
2010

174views more SIAMCOMP 2010»

On the Complexity of Nash Equilibria and Other Fixed Points

13 years 10 months ago

Download homepages.inf.ed.ac.uk

We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a ﬁxed point of a given Brouwer function, and we investigate the complexity o...

Kousha Etessami, Mihalis Yannakakis

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	174	On the Complexity of Nash Equilibria and Other Fixed Points	claim
2	172	Deterministic Polynomial Time Algorithms for Matrix Completion Problems	claim
3	172	More Algorithms for All-Pairs Shortest Paths in Weighted Graphs	claim
4	147	Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized	claim
5	135	Intractability of Clique-Width Parameterizations	claim
6	133	Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs	claim
7	125	Approximating Steiner Networks with Node-Weights	claim
8	120	Edge Disjoint Paths in Moderately Connected Graphs	claim
9	109	Analysis of Delays Caused by Local Synchronization	claim
10	105	Fast Access to Distributed Atomic Memory	claim
11	104	Approximation Algorithms for Scheduling Parallel Jobs	claim
12	104	Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service	claim
13	100	Algorithmic Enumeration of Ideal Classes for Quaternion Orders	claim
14	97	Designing Network Protocols for Good Equilibria	claim
15	97	Lower Bounds for Randomized Consensus under a Weak Adversary	claim
16	96	Quantified Equality Constraints	claim
17	94	Local Monotonicity Reconstruction	claim
18	93	Tightening Nonsimple Paths and Cycles on Surfaces	claim
19	88	Hardness Amplification Proofs Require Majority	claim
20	85	Approximate Halfspace Range Counting	claim
21	83	Reaching and Distinguishing States of Distributed Systems	claim
22	77	The Computational Hardness of Estimating Edit Distance	claim
23	76	On Spanners and Lightweight Spanners of Geometric Graphs	claim
24	71	The Local Nature of List Colorings for Graphs of High Girth	claim
25	64	Preprocessing Imprecise Points and Splitting Triangulations	claim
26	55	The PSPACE-Completeness of Black-White Pebbling	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers