6 citations · 25 across the 18 of their papers we have counts for
4 papers · 1 filter
An Efficient and Robust Committee Structure for Sharding Blockchain
Mengqian Zhang, Jichen Li, Zhaohua Chen +2
Nowadays, sharding is deemed as a promising way to save traditional blockchain protocols from their low scalability. However, such technique also brings several potential risks and…
Is Nash Equilibrium Approximator Learnable?
Zhijian Duan, Wenhan Huang, Dinghuai Zhang +4
In this paper, we investigate the learnability of the function approximator that approximates Nash equilibrium (NE) for games generated from a distribution. First, we offer a gener…
From Monopoly to Competition: Optimal Contests Prevail
Xiaotie Deng, Yotam Gafni, Ron Lavi +2
We study competition among contests in a general model that allows for an arbitrary and heterogeneous space of contest design, where the goal of the contest designers is to maximiz…
On Tightness of Tsaknakis-Spirakis Descent Methods for Approximate Nash Equilibria
Zhaohua Chen, Xiaotie Deng, Wenhan Huang +2
This article explores the minimum approximation ratio for Nash equilibrium in bi-matrix games, focusing on the Tsaknakis and Spirakis (TS) methods. The previous SOTA, TS algorithm,…