In this paper we propose a new methodology for determining approximate Nash equilibria of non-cooperative bimatrix games and, based on that, we provide an efficient algorithm that computes 0.3393- approximate Equilibria, the best approximation till now.Expand

We study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links.Expand

We generalize Cuckoo Hashing to d-ary Cuckroo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ε)n memory cells, for any constant ε > 0.Expand

We generalize Cuckoo Hashing to d-ary hashing and show how this yields a simple dictionary that has worst case constant access time and expected constant update time, works with (1+?) n space, and supports satellite information.Expand