Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem

DOI10.1145/2746539.2746566zbMath1322.91006arXiv1406.2296OpenAlexW2200725028MaRDI QIDQ2941526

Siddharth Barman

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.2296

zbMATH Keywords

Khintchine inequalityNash equilibriaCarathéodory's theorembilinear programs

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Approximation algorithms (68W25)

Related Items

Space exploration via proximity search ⋮ A Selective Tour Through Congestion Games ⋮ Costly circuits, submodular schedules and approximate Carathéodory theorems ⋮ From approximate to exact integer programming ⋮ Theorems of Carathéodory, Helly, and Tverberg without dimension ⋮ Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm ⋮ Regularity lemmas in a Banach space setting ⋮ Non-Negative Sparse Regression and Column Subset Selection with L1 Error ⋮ Computational aspects of the colorful Carathéodory theorem ⋮ Lipschitz continuity and approximate equilibria ⋮ Approximate Carathéodory's theorem in uniformly smooth Banach spaces ⋮ Approximating the existential theory of the reals ⋮ Sparse Approximation via Generating Point Sets ⋮ Approximating the existential theory of the reals ⋮ Lipschitz Continuity and Approximate Equilibria ⋮ Uniformly supported approximate equilibria in families of games ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ No‐dimension Tverberg's theorem and its corollaries in Banach spaces of type p ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming