default search action
Yifeng Teng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c17]Jiahao Zhang, Tao Lin, Weiqiang Zheng, Zhe Feng, Yifeng Teng, Xiaotie Deng:
Learning Thresholds with Latent Values and Censored Feedback. ICLR 2024 - [c16]Yuan Deng
, Jieming Mao
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. WWW 2024: 256-266 - [i19]Gagan Aggarwal, Ashwinkumar Badanidiyuru, Santiago R. Balseiro, Kshipra Bhawalkar, Yuan Deng, Zhe Feng, Gagan Goel, Christopher Liaw, Haihao Lu, Mohammad Mahdian, Jieming Mao, Aranyak Mehta, Vahab Mirrokni, Renato Paes Leme, Andrés Perlroth, Georgios Piliouras, Jon Schneider, Ariel Schvartzman, Balasubramanian Sivan, Kelly Spendlove, Yifeng Teng, Di Wang, Hanrui Zhang, Mingfei Zhao, Wennan Zhu, Song Zuo:
Auto-bidding and Auctions in Online Advertising: A Survey. CoRR abs/2408.07685 (2024) - 2023
- [c15]Bobby Kleinberg, Renato Paes Leme, Jon Schneider, Yifeng Teng:
U-Calibration: Forecasting for an Unknown Agent. COLT 2023: 5143-5145 - [c14]Paul Dütting
Prophet Secretary Against the Online Optimal. EC 2023: 561-581 - [c13]Renato Paes Leme
Description Complexity of Regular Distributions. EC 2023: 959 - [c12]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. SODA 2023: 399-415 - [c11]Shuchi Chawla
Buy-Many Mechanisms for Many Unit-Demand Buyers. WINE 2023: 21-38 - [c10]Zihan Tan
Worst-Case Welfare of Item Pricing in the Tollbooth Problem. WWW 2023: 3508-3518 - [i18]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Description Complexity of Regular Distributions. CoRR abs/2305.05590 (2023) - [i17]Paul Dütting, Evangelia Gergatsouli, Rojin Rezvan, Yifeng Teng, Alexandros Tsigonias-Dimitriadis:
Prophet Secretary Against the Online Optimal. CoRR abs/2305.11144 (2023) - [i16]Robert Kleinberg, Renato Paes Leme, Jon Schneider, Yifeng Teng:
U-Calibration: Forecasting for an Unknown Agent. CoRR abs/2307.00168 (2023) - [i15]Yuan Deng, Jieming Mao, Vahab Mirrokni, Yifeng Teng, Song Zuo:
Non-uniform Bid-scaling and Equilibria for Different Auctions: An Empirical Study. CoRR abs/2311.10679 (2023) - [i14]Jiahao Zhang, Tao Lin, Weiqiang Zheng, Zhe Feng, Yifeng Teng, Xiaotie Deng:
Learning Thresholds with Latent Values and Censored Feedback. CoRR abs/2312.04653 (2023) - 2022
- [j4]Shuchi Chawla, Yifeng Teng, Christos Tzamos
Buy-many mechanisms are not much better than item pricing. Games Econ. Behav. 134: 104-116 (2022) - [c9]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing ordered items. STOC 2022: 722-735 - [c8]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari
Online Allocation and Display Ads Optimization with Surplus Supply. WINE 2022: 41-59 - [i13]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Buy-Many Mechanisms for Many Unit-Demand Buyers. CoRR abs/2204.01962 (2022) - 2021
- [c7]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. ICML 2021: 6223-6232 - [i12]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Learning to Price Against a Moving Target. CoRR abs/2106.04689 (2021) - [i11]Shuchi Chawla, Rojin Rezvan, Yifeng Teng, Christos Tzamos:
Pricing Ordered Items. CoRR abs/2106.04704 (2021) - [i10]Zihan Tan, Yifeng Teng, Mingfei Zhao:
Worst-Case Welfare of Item Pricing in the Tollbooth Problem. CoRR abs/2107.05690 (2021) - [i9]Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari, Balasubramanian Sivan, Yifeng Teng, Creighton Thomas:
Online Allocation and Display Ads Optimization with Surplus Supply. CoRR abs/2107.06980 (2021) - [i8]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng, Pratik Worah:
Pricing Query Complexity of Revenue Maximization. CoRR abs/2111.03158 (2021) - 2020
- [j3]Shuchi Chawla, Yifeng Teng, Christos Tzamos
Buy-many mechanisms: what are they and why should you care? SIGecom Exch. 18(1): 12-18 (2020) - [c6]Shuchi Chawla, Evangelia Gergatsouli
Pandora's Box with Correlations: Learning and Approximation. FOCS 2020: 1214-1225 - [c5]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. EC 2020: 475-476 - [c4]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng:
Why Do Competitive Markets Converge to First-Price Auctions? WWW 2020: 596-605 - [i7]Renato Paes Leme, Balasubramanian Sivan, Yifeng Teng:
Why Do Competitive Markets Converge to First-Price Auctions? CoRR abs/2001.06074 (2020) - [i6]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Menu-size Complexity and Revenue Continuity of Buy-many Mechanisms. CoRR abs/2003.10636 (2020)
2010 – 2019
- 2019
- [j2]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. Proc. VLDB Endow. 13(1): 1-14 (2019) - [c3]Shuchi Chawla, Yifeng Teng, Christos Tzamos
Buy-Many Mechanisms are Not Much Better than Item Pricing. EC 2019: 237-238 - [c2]Shuchi Chawla, J. Benjamin Miller, Yifeng Teng:
Pricing for Online Resource Allocation: Intervals and Paths. SODA 2019: 1962-1981 - [i5]Shuchi Chawla, Yifeng Teng, Christos Tzamos:
Reasonable multi-item mechanisms are not much better than item pricing. CoRR abs/1902.10315 (2019) - [i4]Shuchi Chawla, Shaleen Deep, Paraschos Koutris, Yifeng Teng:
Revenue Maximization for Query Pricing. CoRR abs/1909.00845 (2019) - [i3]Shuchi Chawla, Evangelia Gergatsouli, Yifeng Teng, Christos Tzamos, Ruimin Zhang:
Learning Optimal Search Algorithms from Data. CoRR abs/1911.01632 (2019) - 2017
- [c1]Pingzhong Tang, Yifeng Teng, Zihe Wang, Shenke Xiao, Yichong Xu:
Computational Issues in Time-Inconsistent Planning. AAAI 2017: 3665-3671 - [i2]Shuchi Chawla, J. Benjamin Miller, Dimitris Paparas, Yifeng Teng:
Pricing for Online Resource Allocation: Beyond Subadditive Values. CoRR abs/1708.00043 (2017) - 2016
- [j1]Yifeng Teng, Shenghao Yang
Tight Bound on Randomness for Violating the Clauser-Horne-Shimony-Holt Inequality. IEEE Trans. Inf. Theory 62(4): 1748-1757 (2016) - 2014
- [i1]Pingzhong Tang, Yifeng Teng, Zihe Wang, Shenke Xiao, Yichong Xu:
Settling the open problems in Kleinberg-Oren time-inconsistent planning models. CoRR abs/1411.7472 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 00:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: