10 citations · 14 across the 8 of their papers we have counts for
6 papers · 1 filter
Approximating N-Player Nash Equilibrium through Gradient Descent
Dongge Wang, Xiang Yan, Zehao Dou +3
Decoding how rational agents should behave in shared systems remains a critical challenge within theoretical computer science, artificial intelligence and economics studies. Centra…
A survey on algorithms for Nash equilibria in finite normal-form games
Hanyu Li, Wenhan Huang, Zhijian Duan +4
Nash equilibrium is one of the most influential solution concepts in game theory. With the development of computer science and artificial intelligence, there is an increasing deman…
No-regret Learning in Repeated First-Price Auctions with Budget Constraints
Rui Ai, Chang Wang, Chenchen Li +3
Recently the online advertising market has exhibited a gradual shift from second-price auctions to first-price auctions. Although there has been a line of works concerning online b…
ABSNFT: Securitization and Repurchase Scheme for Non-Fungible Tokens Based on Game Theoretical Analysis
Hongyin Chen, Yukun Cheng, Xiaotie Deng +2
The Non-Fungible Token (NFT) is viewed as one of the important applications of blockchain technology. Although NFT has a large market scale and multiple practical standards, severa…
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…
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,…