Yuhao Li

Orcid: 0000-0001-5281-8742

Affiliations:
  • Columbia University, Computer Science Department, New York, NY, USA
  • Peking University, Center on Frontiers of Computer Studies, Beijing, China (former)


According to our database1, Yuhao Li authored at least 18 papers between 2020 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Computing a Fixed Point of Contraction Maps in Polynomial Queries.
Electron. Colloquium Comput. Complex., 2024

Computing a Fixed Point of Contraction Maps in Polynomial Queries.
CoRR, 2024

Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Intersection Classes in TFNP and Proof Complexity.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Testing Intersecting and Union-Closed Families.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
On tightness of Tsaknakis-Spirakis descent methods for approximate Nash equilibria.
Inf. Comput., August, 2023

Reducing Tarski to Unique Tarski (in the Black-box Model).
Electron. Colloquium Comput. Complex., 2023

Learning to Manipulate a Commitment Optimizer.
CoRR, 2023

MEV Makes Everyone Happy under Greedy Sequencing Rule.
Proceedings of the 2023 Workshop on Decentralized Finance and Security, 2023

2022
Study on Agent Incentives for Resource Sharing on P2P Networks.
Asia Pac. J. Oper. Res., 2022

Insightful Mining Equilibria.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Optimal Private Payoff Manipulation Against Commitment in Extensive-form Games.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Tight Incentive Analysis on Sybil Attacks to Market Equilibrium of Resource Exchange over General Networks.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Improved Upper Bounds for Finding Tarski Fixed Points.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
On the Complexity of Computing Markov Perfect Equilibrium in General-Sum Stochastic Games.
Electron. Colloquium Comput. Complex., 2021

On Tightness of the Tsaknakis-Spirakis Algorithm for Approximate Nash Equilibrium.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

2020
Tightening Up the Incentive Ratio for Resource Sharing Over the Rings.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Limiting the Deviation Incentives in Resource Sharing Networks.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020


  Loading...