3 papers
cs.GT2026
On the Complexity of Mixed Equilibria in First-Price Auctions with Correlated Priors
Mark Chen, Xi Chen, Hao Cui +2
We show that computing an approximate mixed Bayes-Nash equilibrium in a discrete first-price auction with correlated priors is PPAD-complete. The key intermediate step in our reduc…
cs.CC2025
Boolean function monotonicity testing requires (almost) queries
Mark Chen, Xi Chen, Hao Cui +2
We show that for any constant , any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity . This improves…
math.NT2023
Sums of Reciprocals of Recurrence Relations
Hao Cui, Xiaoyu Cui, Sophia C. Davis +7
There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci nu…