1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.GT2025
Finding a Nash equilibrium of a random win-lose game in expected polynomial time
Andrea Collevecchio, Gabor Lugosi, Adrian Vetta +1
A long-standing open problem in algorithmic game theory asks whether or not there is a polynomial time algorithm to compute a Nash equilibrium in a random bimatrix game. We study r…
math.PR2025
Multivariate Poisson approximation of joint subgraph counts in random graphs via size-biased couplings
Eulalia Nualart, Rui-Ray Zhang
Using Chen-Stein method in combination with size-biased couplings, we obtain the multivariate Poisson approximation in terms of the Wasserstein distance. As applications, we study…
math.PR2021★ 1 cited
When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
Rui-Ray Zhang
We establish concentration inequalities for Lipschitz functions of dependent random variables, whose dependencies are specified by forests. We also give concentration results for d…