21 citations · 75 across the 21 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.GT2014★ 4 cited
Approximate well-supported Nash equilibria in symmetric bimatrix games
Artur Czumaj, Michail Fasoulakis, Marcin Jurdziński
The -well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than to deviate…
cs.DS2014
Planar Graphs: Random Walks and Bipartiteness Testing
Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak +1
We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqr…