activity
20212026
most citedOn Tightness of Tsaknakis-Spirakis Descent Methods for Approximate Nash Equilibria

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing cs.GTShow all

8 papers · 1 filter

cs.GT2026

Autobidding Equilibria in Sponsored Shopping

Paul Dütting, Yuhao Li, Renato Paes Leme +2

As commerce shifts to digital marketplaces, platforms increasingly monetize traffic through Sponsored Shopping auctions. Unlike classic ``Sponsored Search", where an advertiser typ…

cs.GT2025

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions

Xi Chen, Yuhao Li

In this paper, we revisit the problem of approximating a pacing equilibrium in second-price auctions, introduced by Conitzer, Kroer, Sodomka, and Moses [Oper. Res. 2022]. We show t…

cs.GT2023

MEV Makes Everyone Happy under Greedy Sequencing Rule

Yuhao Li, Mengqian Zhang, Jichen Li +3

Trading through decentralized exchanges (DEXs) has become crucial in today's blockchain ecosystem, enabling users to swap tokens efficiently and automatically. However, the capacit…

cs.GT2023

Learning to Manipulate a Commitment Optimizer

Yurong Chen, Xiaotie Deng, Jiarui Gan +1

It is shown in recent studies that in a Stackelberg game the follower can manipulate the leader by deviating from their true best-response behavior. Such manipulations are computat…

cs.GT2022

Optimal Private Payoff Manipulation against Commitment in Extensive-form Games

Yurong Chen, Xiaotie Deng, Yuhao Li

To take advantage of strategy commitment, a useful tactic of playing games, a leader must learn enough information about the follower's payoff function. However, this leaves the fo…

cs.GT2022

Insightful Mining Equilibria

Mengqian Zhang, Yuhao Li, Jichen Li +2

The selfish mining attack, arguably the most famous game-theoretic attack in blockchain, indicates that the Bitcoin protocol is not incentive-compatible. Most subsequent works main…

cs.GT2022

Improved Upper Bounds for Finding Tarski Fixed Points

Xi Chen, Yuhao Li

We study the query complexity of finding a Tarski fixed point over the -dimensional grid . Improving on the previous best upper bound of $\smash{O(\log^{\lceil…

cs.GT2021★ 1 cited

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,…