24 citations · 86 across the 22 of their papers we have counts for
5 papers · 1 filter
Complexity of Equilibria in First-Price Auctions under General Tie-Breaking Rules
Xi Chen, Binghui Peng
We study the complexity of finding an approximate (pure) Bayesian Nash equilibrium in a first-price auction with common priors when the tie-breaking rule is part of the input. We s…
Public Goods Games in Directed Networks
Christos Papadimitriou, Binghui Peng
Public goods games in undirected networks are generally known to have pure Nash equilibria, which are easy to find. In contrast, we prove that, in directed networks, a broad range…
Computational Hardness of the Hylland-Zeckhauser Scheme
Thomas Chen, Xi Chen, Binghui Peng +1
We study the complexity of the classic Hylland-Zeckhauser scheme [HZ'79] for one-sided matching markets. We show that the problem of finding an -approximate equilibrium in the H…
Hedging in games: Faster convergence of external and swap regrets
Xi Chen, Binghui Peng
We consider the setting where players run the Hedge algorithm or its optimistic variant to play an -action game repeatedly for rounds. 1) For two-player games, we show that…
Reinforcement Mechanism Design, with Applications to Dynamic Pricing in Sponsored Search Auctions
Weiran Shen, Binghui Peng, Hanpeng Liu +7
In this study, we apply reinforcement learning techniques and propose what we call reinforcement mechanism design to tackle the dynamic pricing problem in sponsored search auctions…