# Yang Cai

According to our database

Collaborative distances:

^{1}, Yang Cai authored at least 32 papers between 2009 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

An Efficient ε-BIC to BIC Transformation and Its Application to Black-Box Reduction in Revenue Maximization.

CoRR, 2019

Multi-Item Mechanisms without Item-Independence: Learnability via Robustness.

CoRR, 2019

Simple Mechanisms for Profit Maximization in Multi-item Auctions.

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Simple and Approximately Optimal Pricing for Proportional Complementarities.

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Simple mechanisms for subadditive buyers via duality.

SIGecom Exchanges, 2018

The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade.

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Learning Safe Policies with Expert Guidance.

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Approximating Gains from Trade in Two-sided Markets via Simple Mechanisms.

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Learning Multi-Item Auctions with (or without) Samples.

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Reducing Bayesian Mechanism Design to Algorithm Design.

Encyclopedia of Algorithms, 2016

A duality-based unified approach to Bayesian mechanism design.

SIGecom Exchanges, 2016

Zero-Sum Polymatrix Games: A Generalization of Minmax.

Math. Oper. Res., 2016

On the Economic Efficiency of the Combinatorial Clock Auction.

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Extreme value theorems for optimal multidimensional pricing.

Games and Economic Behavior, 2015

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Optimum Statistical Estimation with Strategic Data Sources.

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Biobjective Online Bipartite Matching.

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Simultaneous bayesian auctions and computational complexity.

Proceedings of the ACM Conference on Economics and Computation, 2014

2013

Mechanism design : a new algorithmic framework.

PhD thesis, 2013

Designing Markets for Daily Deals.

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Simple and Nearly Optimal Multi-Item Auctions.

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Understanding Incentives: Mechanism Design Becomes Algorithm Design.

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Can Nondeterminism Help Complementation?

Proceedings of the Proceedings Third International Symposium on Games, 2012

Optimal Multi-dimensional Mechanism Design: Reducing Revenue to Welfare Maximization.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

On optimal multidimensional mechanism design.

SIGecom Exchanges, 2011

An Algorithmic Characterization of Multi-Dimensional Mechanisms.

Electronic Colloquium on Computational Complexity (ECCC), 2011

On Minmax Theorems for Multiplayer Games.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Tight Lower Bound for Streett Complementation.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Tight Upper Bounds for Streett and Parity Complementation.

Proceedings of the Computer Science Logic, 2011

2009

Api hyperlinking via structural overlap.

Proceedings of the 7th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2009

An Improved Lower Bound for the Complementation of Rabin Automata.

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009