Obserwuj
Chun Ye
Tytuł
Cytowane przez
Cytowane przez
Rok
Capacity constrained assortment optimization under the markov chain based choice model
A Désir, V Goyal, D Segev, C Ye
Available at SSRN 2626484, 2015
140*2015
Cake cutting algorithms for piecewise constant and piecewise uniform valuations
H Aziz, C Ye
International conference on web and internet economics, 1-14, 2014
682014
ORL: Reinforcement Learning Benchmarks for Online Stochastic Optimization Problems
CY Bharathan Balaji, Jordan Bell-Masterson, Enes Bilgin, Andreas Damianou ...
https://arxiv.org/abs/1911.10641, 2019
55*2019
Approximately Optimal Mechanisms for Strategyproof Facility Location: Minimizing Lp Norm of Costs
I Feigenbaum, J Sethuraman, C Ye
Mathematics of Operations Research 42 (2), 434-447, 2017
332017
Ex post Efficiency of Random Assignments.
H Aziz, S Mackenzie, L Xia, C Ye
AAMAS, 1639-1640, 2015
232015
Approximation algorithms for the incremental knapsack problem via disjunctive programming
D Bienstock, J Sethuraman, C Ye
arXiv preprint arXiv:1311.4563, 2013
132013
A note on the assignment problem with uniform preferences
J Sethuraman, C Ye
Operations Research Letters 43 (3), 283-287, 2015
62015
On the trade-offs between modeling power and algorithmic complexity
C Ye
Columbia University, 2016
42016
Rigidity of Graph Joins and Hendrickson's Conjecture
T Sun, C Ye
arXiv preprint arXiv:1011.3208, 2010
12010
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–9