8 citations · 27 across the 13 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2021★ 2 cited
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…
cs.GT2020
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…
cs.GT2019
An Axiomatic Approach to Block Rewards
Xi Chen, Christos Papadimitriou, Tim Roughgarden
Proof-of-work blockchains reward each miner for one completed block by an amount that is, in expectation, proportional to the number of hashes the miner contributed to the mining o…