Searching for authors named "Constantinos Daskalakis" – sorted by Relevance.
14 documents found, showing 1 through 10.
Next 10 →
-
Computing pure Nash equilibria via Markov random fields
- …In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a graphical game has a pure Nash equilibrium, a well-known intractab…
- Cited by 3 (1 self) – Add To MetaCart
-
Progress in approximate Nash equilibria
- …It is known [5] that an additively ɛ-approximate Nash equilibrium (with supports of size at most two) can be computed in polynomial time in any 2-player game with ɛ =.5. It is also known that no approximation better than.5 is possible unless equilibria with support larger than log n are considered, …
- Cited by 5 (0 self) – Add To MetaCart
-
Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel’s Conjecture
- …One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolutionary tree. Given samples from this Markov chain at the leaves of the tree, the goal is to reconstruct the evolutionary…
- Add To MetaCart
-
Phylogenies without branch bounds: Contracting the short, pruning the deep
- …We introduce a new phylogenetic reconstruction algorithm which, unlike most previous rigorous inference techniques, does not rely on assumptions regarding the branch lengths or the depth of the tree. The algorithm returns a forest which is guaranteed to contain all edges that are: 1) sufficiently lo…
- Cited by 1 (0 self) – Add To MetaCart
-
Optimal phylogenetic reconstruction
- …One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. This problem is of critical importance in almost all areas of biology and has a very clear mathematical formulation. The evolutionary model is given by a Markov chain on the true evolution…
- Cited by 8 (5 self) – Add To MetaCart
-
A note on approximate Nash equilibria
- …Abstract. In view of the intractability of finding a Nash equilibrium, it is important to understand the limits of approximation in this context. A subexponential approximation scheme is known [LMM03], and no approximation better than 1 is possible by any algorithm that examines 4 equilibria involvi…
- Cited by 12 (3 self) – Add To MetaCart
-
Three-player games are hard
- …We prove that computing a Nash equilibrium in a 3-player game is PPAD-complete, solving a problem left open in (2).…
- Cited by 16 (0 self) – Add To MetaCart
-
The game world is flat: The complexity of Nash equilibria in succinct games
- …Abstract. A recent sequence of results established that computing Nash equilibria in normal form games is a PPAD-complete problem even in the case of two players [11,6,4]. By extending these techniques we prove a general theorem, showing that, for a far more general class of families of succinctly r…
- Cited by 8 (2 self) – Add To MetaCart
-
Three-Player Games Are Hard
- …We prove that computing a Nash equilibrium in a 3-player game is PPAD-complete, solving a problem left open in (2).…
- Add To MetaCart
-
S .Roch: First to market is not everything: an analysis of preferential attachment with fitness, STOC
- …The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the networks of interest, such as the Internet, the web graph, social networks or online communities. To this end, preferential atta…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
