Yifeng Teng

Orcid: 0000-0002-4824-3840

According to our database1, Yifeng Teng authored at least 25 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Learning Thresholds with Latent Values and Censored Feedback.
CoRR, 2023

Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study.
CoRR, 2023

U-Calibration: Forecasting for an Unknown Agent.
CoRR, 2023

Worst-Case Welfare of Item Pricing in the Tollbooth Problem.
Proceedings of the ACM Web Conference 2023, 2023

Buy-Many Mechanisms for Many Unit-Demand Buyers.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Pricing Query Complexity of Revenue Maximization.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Description Complexity of Regular Distributions.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Prophet Secretary Against the Online Optimal.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

U-Calibration: Forecasting for an Unknown Agent.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Buy-many mechanisms are not much better than item pricing.
Games Econ. Behav., 2022

Online Allocation and Display Ads Optimization with Surplus Supply.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Pricing ordered items.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Learning to Price Against a Moving Target.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Buy-many mechanisms: what are they and why should you care?
SIGecom Exch., 2020

Why Do Competitive Markets Converge to First-Price Auctions?
Proceedings of the WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020, 2020

Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Pandora's Box with Correlations: Learning and Approximation.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Revenue Maximization for Query Pricing.
Proc. VLDB Endow., 2019

Learning Optimal Search Algorithms from Data.
CoRR, 2019

Reasonable multi-item mechanisms are not much better than item pricing.
CoRR, 2019

Pricing for Online Resource Allocation: Intervals and Paths.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2017
Pricing for Online Resource Allocation: Beyond Subadditive Values.
CoRR, 2017

Computational Issues in Time-Inconsistent Planning.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Tight Bound on Randomness for Violating the Clauser-Horne-Shimony-Holt Inequality.
IEEE Trans. Inf. Theory, 2016

2014
Settling the open problems in Kleinberg-Oren time-inconsistent planning models.
CoRR, 2014


  Loading...