Yiding Feng

Orcid: 0000-0002-8258-6994

According to our database1, Yiding Feng authored at least 22 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Rationality-Robust Information Design: Bayesian Persuasion under Quantal Response.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Small-sample size problems solving based on incremental learning: an adaptive Bayesian quadrature approach.
Appl. Intell., June, 2023

Strategic Budget Selection in a Competitive Autobidding World.
CoRR, 2023

Mobility Data in Operations: The Facility Location Problem.
CoRR, 2023

Simple Mechanisms for Non-linear Agents.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Competitive Information Design for Pandora's Box.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Online Resource Allocation with Buyback: Optimal Algorithms via Primal-Dual.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Dynamic Pricing and Learning with Bayesian Persuasion.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Controlling Epidemic Spread: Reducing Economic Losses with Targeted Closures.
Manag. Sci., 2022

Batching and Optimal Multi-stage Bipartite Allocations.
CoRR, 2022

Two-stage Stochastic Matching and Pricing with Applications to Ride Hailing.
CoRR, 2022

Online Bayesian Recommendation with No Regret.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Near-Optimal Bayesian Online Assortment of Reusable Resources.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Bias-Variance Games.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021
Competitive Information Disclosure with Multiple Receivers.
CoRR, 2021

Revelation gap for pricing from samples.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Two-stage Stochastic Matching with Application to Ride Hailing.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Global Concavity and Optimization in a Class of Dynamic Discrete Choice Models.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Optimal Auctions vs. Anonymous Pricing: Beyond Linear Utility.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents).
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Kernel framework based on non-negative matrix factorization for networks reconstruction and link prediction.
Knowl. Based Syst., 2017


  Loading...