Yixin Tao

Orcid: 0000-0002-0573-1369

According to our database1, Yixin Tao authored at least 20 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Approximating Competitive Equilibrium by Nash Welfare.
CoRR, 2024

2023
A First Order Method for Linear Programming Parameterized by Circuit Imbalance.
CoRR, 2023

Mode Connectivity in Auction Design.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Approximating Equilibrium under Constrained Piecewise Linear Concave Utilities with Applications to Matching Markets.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Evolution of Uncertainty of Learning in Games.
Proceedings of the Tenth International Conference on Learning Representations, 2022

2021
Parallel Stochastic Asynchronous Coordinate Descent: Tight Bounds on the Possible Parallelism.
SIAM J. Optim., 2021

Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup.
Math. Program., 2021

On the existence of Pareto Efficient and envy-free allocations.
J. Econ. Theory, 2021

Selecting a Match: Exploration vs Decision.
CoRR, 2021

Chaos of Learning Beyond Zero-sum and Coordination via Game Decompositions.
Proceedings of the 9th International Conference on Learning Representations, 2021

2020
Market Efficiency and Dynamics.
PhD thesis, 2020

2019
Balancing the Robustness and Convergence of Tatonnement.
CoRR, 2019

2018
(Near) Optimal Parallelism Bound for Fully Asynchronous Coordinate Descent with Linear Speedup.
CoRR, 2018

An Analysis of Asynchronous Stochastic Accelerated Coordinate Descent.
CoRR, 2018

Dynamics of Distributed Updating in Fisher Markets.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2016
Large Market Games with Near Optimal Efficiency.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Towards Privacy Preservation in Strategy-Proof Spectrum Auction Mechanisms for Noncooperative Wireless Networks.
IEEE/ACM Trans. Netw., 2015

The Price of Anarchy of Large Walrasian Auctions.
CoRR, 2015

2014
Generalized second price auction with probabilistic broad match.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
SPRING: A Strategy-proof and Privacy preserving spectrum auction mechanism.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013


  Loading...