default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYiding Feng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Yiding Feng, Rad Niazadeh
, Amin Saberi:
Two-Stage Stochastic Matching and Pricing with Applications to Ride Hailing. Oper. Res. 72(4): 1574-1594 (2024)- [j4]Yiding Feng, Rad Niazadeh, Amin Saberi:
Technical Note - Near-Optimal Bayesian Online Assortment of Reusable Resources. Oper. Res. 72(5): 1861-1873 (2024) - [c15]Yiding Feng, Chien-Ju Ho, Wei Tang:
Rationality-Robust Information Design: Bayesian Persuasion under Quantal Response. SODA 2024: 501-546 - [c14]Yiding Feng, Brendan Lucier, Aleksandrs Slivkins:
Strategic Budget Selection in a Competitive Autobidding World. STOC 2024: 213-224 - 2023
- [j3]Yiding Feng, Xiang Feng, Huiqun Yu:
Small-sample size problems solving based on incremental learning: an adaptive Bayesian quadrature approach. Appl. Intell. 53(12): 15174-15187 (2023) - [c13]Shipra Agrawal, Yiding Feng, Wei Tang:
Dynamic Pricing and Learning with Bayesian Persuasion. NeurIPS 2023 - [c12]Farbod Ekbatani, Yiding Feng, Rad Niazadeh:
Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual. EC 2023: 583 - [c11]Bolin Ding, Yiding Feng, Chien-Ju Ho, Wei Tang, Haifeng Xu:
Competitive Information Design for Pandora's Box. SODA 2023: 353-381 - [c10]Yiding Feng, Jason D. Hartline, Yingkai Li:
Simple Mechanisms for Non-linear Agents. SODA 2023: 3802-3816 - [i14]Ozan Candogan, Yiding Feng:
Mobility Data in Operations: The Facility Location Problem. CoRR abs/2301.06246 (2023) - [i13]Shipra Agrawal, Yiding Feng, Wei Tang:
Dynamic Pricing and Learning with Bayesian Persuasion. CoRR abs/2304.14385 (2023) - [i12]Yiding Feng, Brendan Lucier, Aleksandrs Slivkins:
Strategic Budget Selection in a Competitive Autobidding World. CoRR abs/2307.07374 (2023) - 2022
- [j2]John R. Birge, Ozan Candogan, Yiding Feng:
Controlling Epidemic Spread: Reducing Economic Losses with Targeted Closures. Manag. Sci. 68(5): 3175-3195 (2022) - [c9]Yiding Feng, Ronen Gradwohl, Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov:
Bias-Variance Games. EC 2022: 328-329 - [c8]Yiding Feng, Wei Tang, Haifeng Xu:
Online Bayesian Recommendation with No Regret. EC 2022: 818-819 - [c7]Yiding Feng, Rad Niazadeh, Amin Saberi:
Near-Optimal Bayesian Online Assortment of Reusable Resources. EC 2022: 964-965 - [i11]Yiding Feng, Wei Tang, Haifeng Xu:
Online Bayesian Recommendation with No Regret. CoRR abs/2202.06135 (2022) - [i10]Yiding Feng, Chien-Ju Ho, Wei Tang:
Rationality-Robust Information Design: Bayesian Persuasion under Quantal Response. CoRR abs/2207.08253 (2022) - [i9]Farbod Ekbatani, Yiding Feng, Rad Niazadeh:
Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual. CoRR abs/2210.11570 (2022) - [i8]Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing. CoRR abs/2210.11648 (2022) - [i7]Yiding Feng, Rad Niazadeh:
Batching and Optimal Multi-stage Bipartite Allocations. CoRR abs/2211.16581 (2022) - 2021
- [c6]Yiding Feng, Rad Niazadeh:
Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract). ITCS 2021: 88:1-88:1 - [c5]Yiding Feng, Rad Niazadeh, Amin Saberi:
Two-stage Stochastic Matching with Application to Ride Hailing. SODA 2021: 2862-2877 - [c4]Yiding Feng, Jason D. Hartline, Yingkai Li:
Revelation gap for pricing from samples. STOC 2021: 1438-1451 - [i6]Yiding Feng, Jason D. Hartline, Yingkai Li:
Revelation Gap for Pricing from Samples. CoRR abs/2102.13496 (2021) - [i5]Bolin Ding, Yiding Feng, Chien-Ju Ho, Wei Tang:
Competitive Information Disclosure with Multiple Receivers. CoRR abs/2103.03769 (2021) - 2020
- [c3]Yiding Feng, Ekaterina Khmelnitskaya, Denis Nekipelov:
Global Concavity and Optimization in a Class of Dynamic Discrete Choice Models. ICML 2020: 3082-3091 - [i4]Yiding Feng, Jason D. Hartline, Yingkai Li:
Simple Mechanisms for Non-linear Agents. CoRR abs/2003.00545 (2020)
2010 – 2019
- 2019
- [c2]Yiding Feng, Jason D. Hartline, Yingkai Li:
Optimal Auctions vs. Anonymous Pricing: Beyond Linear Utility. EC 2019: 885-886 - [i3]Yiding Feng, Jason D. Hartline, Yingkai Li:
Optimal Auctions vs. Anonymous Pricing: Beyond Linear Utility. CoRR abs/1905.04257 (2019) - [i2]Yiding Feng, Ronen Gradwohl, Jason D. Hartline, Aleck C. Johnsen, Denis Nekipelov:
Bias-Variance Games. CoRR abs/1909.03618 (2019) - 2018
- [c1]Yiding Feng, Jason D. Hartline:
An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents). FOCS 2018: 404-415 - [i1]Yiding Feng, Jason D. Hartline:
An End-to-end Argument in Mechanism Design (Prior-independent Auctions for Budgeted Agents). CoRR abs/1804.01977 (2018) - 2017
- [j1]Wenjun Wang, Yiding Feng, Pengfei Jiao, Wei Yu:
Kernel framework based on non-negative matrix factorization for networks reconstruction and link prediction. Knowl. Based Syst. 137: 104-114 (2017)
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-10-23 21:26 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:
