default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiheng Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Guangju Wang, Hailun Zhang
, Jiheng Zhang:
On-Demand Ride-Matching in a Spatial Model with Abandonment and Cancellation. Oper. Res. 72(3): 1278-1297 (2024)- [j16]Xuefeng Gao, Junfei Huang, Jiheng Zhang:
Technical Note - Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees. Oper. Res. 72(4): 1739-1748 (2024) - [j15]Lei Fu, Zuquan Weng, Jiheng Zhang, Haihe Xie, Yiqing Cao:
MMBERT: a unified framework for biomedical named entity recognition. Medical Biol. Eng. Comput. 62(1): 327-341 (2024) - [j14]Zhenghua Long, Tolga Tezcan, Jiheng Zhang:
Routing and Staffing in Customer Service Chat Systems with Generally Distributed Service and Patience Times. Manuf. Serv. Oper. Manag. 26(5): 1674-1691 (2024) - [c10]Junyi Fan, Yuxuan Han, Jialin Zeng, Jian-Feng Cai, Yang Wang, Yang Xiang, Jiheng Zhang:
RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model. AISTATS 2024: 2035-2043 - [c9]Zhipeng Liang, Xiaoteng Ma, José H. Blanchet, Jun Yang, Jiheng Zhang, Zhengyuan Zhou:
Single-Trajectory Distributionally Robust Reinforcement Learning. ICML 2024 - [i15]Junyi Fan, Yuxuan Han, Jialin Zeng, Jian-Feng Cai, Yang Wang, Yang Xiang, Jiheng Zhang:
RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model. CoRR abs/2403.11544 (2024) - [i14]Xueping Gong, Jiheng Zhang:
Minimax Optimality in Contextual Dynamic Pricing with General Valuation Models. CoRR abs/2406.17184 (2024) - 2023
- [j13]Jiahao He, Guangyuan Zhang, Jiheng Zhang, Rachel Q. Zhang:
Blockchain Operations in the Presence of Security Concerns. Manuf. Serv. Oper. Manag. 25(3): 1117-1135 (2023) - [c8]Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, Jiheng Zhang:
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles. AISTATS 2023: 5011-5035 - [c7]Xueping Gong, Jiheng Zhang:
Achieving Near-optimal Regrets in Confounded Contextual Bandits. AAMAS 2023: 2643-2645 - [c6]Qing Zhang, Xiaoying Zhang, Yang Liu, Hongning Wang, Min Gao, Jiheng Zhang, Ruocheng Guo:
Debiasing Recommendation by Learning Identifiable Latent Confounders. KDD 2023: 3353-3363 - [i13]Zhipeng Liang, Xiaoteng Ma, Jose H. Blanchet, Jiheng Zhang, Zhengyuan Zhou:
Single-Trajectory Distributionally Robust Reinforcement Learning. CoRR abs/2301.11721 (2023) - [i12]Qing Zhang, Xiaoying Zhang, Yang Liu, Hongning Wang, Min Gao, Jiheng Zhang, Ruocheng Guo:
Debiasing Recommendation by Learning Identifiable Latent Confounders. CoRR abs/2302.05052 (2023) - [i11]Xueping Gong, Jiheng Zhang:
Provably Efficient Learning in Partially Observable Contextual Bandit. CoRR abs/2308.03572 (2023) - [i10]Xueping Gong, Jiheng Zhang:
Stochastic Graph Bandit Learning with Side-Observations. CoRR abs/2308.15107 (2023) - 2022
- [c5]Yuxuan Han, Zhicong Liang, Zhipeng Liang, Yang Wang, Yuan Yao, Jiheng Zhang:
Private Streaming SCO in ℓp geometry with Applications in High Dimensional Online Decision Making. ICML 2022: 8249-8279 - [c4]Jiahao He, Jiheng Zhang, Rachel Q. Zhang:
A Reduction from Linear Contextual Bandit Lower Bounds to Estimation Lower Bounds. ICML 2022: 8660-8677 - [i9]Yuxuan Han, Zhicong Liang, Zhipeng Liang, Yang Wang, Yuan Yao, Jiheng Zhang:
On Private Online Convex Optimization: Optimal Algorithms in 𝓁p-Geometry and High Dimensional Contextual Bandits. CoRR abs/2206.08111 (2022) - [i8]Xueping Gong, Jiheng Zhang:
Dual Instrumental Method for Confounded Kernelized Bandits. CoRR abs/2209.03224 (2022) - [i7]Xiaoteng Ma, Zhipeng Liang, Jose H. Blanchet, Mingwen Liu, Li Xia, Jiheng Zhang, Qianchuan Zhao, Zhengyuan Zhou:
Distributionally Robust Offline Reinforcement Learning with Linear Function Approximation. CoRR abs/2209.06620 (2022) - [i6]Yuxuan Han, Jialin Zeng, Yang Wang, Yang Xiang, Jiheng Zhang:
Optimal Contextual Bandits with Knapsacks under Realizibility via Regression Oracles. CoRR abs/2210.11834 (2022) - 2021
- [c3]Yuxuan Han, Zhipeng Liang, Yang Wang, Jiheng Zhang:
Generalized Linear Bandits with Local Differential Privacy. NeurIPS 2021: 26511-26522 - [i5]Yuxuan Han, Zhipeng Liang, Yang Wang, Jiheng Zhang:
Generalized Linear Bandits with Local Differential Privacy. CoRR abs/2106.03365 (2021) - [i4]Qing Zhang, Xueping Gong, Huizhong Li, Hao Wu, Jiheng Zhang:
Improving Blockchain Consistency by Assigning Weights to Random Blocks. CoRR abs/2107.10467 (2021) - 2020
- [j12]Zhenghua Long, Nahum Shimkin, Hailun Zhang, Jiheng Zhang:
Dynamic Scheduling of Multiclass Many-Server Queues with Abandonment: The Generalized cμ/h Rule. Oper. Res. 68(4): 1218-1230 (2020)
2010 – 2019
- 2019
- [j11]Zhenghua Long, Jiheng Zhang:
Virtual allocation policies for many-server queues with abandonment. Math. Methods Oper. Res. 90(3): 399-451 (2019) - [j10]Zhen Xu, Jiheng Zhang, Rachel Q. Zhang:
Instantaneous Control of Brownian Motion with a Positive Lead Time. Math. Oper. Res. 44(3): 943-965 (2019) - [i3]Jiahao He, Guangju Wang, Guangyuan Zhang, Jiheng Zhang:
Consensus Mechanism Design based on Structured Directed Acyclic Graphs. CoRR abs/1901.02755 (2019) - 2018
- [j9]Shining Wu, Jiheng Zhang, Rachel Q. Zhang:
Management of a Shared-Spectrum Network in Wireless Communications. Oper. Res. 66(4): 1119-1135 (2018) - 2017
- [j8]Junfei Huang, Avishai Mandelbaum, Hanqin Zhang, Jiheng Zhang:
Refined Models for Efficiency-Driven Queues with Applications to Delay Announcements and Staffing. Oper. Res. 65(5): 1380-1397 (2017) - 2016
- [j7]Junfei Huang, Hanqin Zhang, Jiheng Zhang:
A Unified Approach to Diffusion Analysis of Queues with General Patience-Time Distributions. Math. Oper. Res. 41(3): 1135-1160 (2016) - 2014
- [j6]Tolga Tezcan, Jiheng Zhang:
Routing and Staffing in Customer Service Chat Systems with Impatient Customers. Oper. Res. 62(4): 943-956 (2014) - [j5]Zhenghua Long, Jiheng Zhang:
Convergence to equilibrium states for fluid models of many-server queues with abandonment. Oper. Res. Lett. 42(6-7): 388-393 (2014) - [c2]Xiaowei Zhang, L. Jeff Hong, Jiheng Zhang:
Scaling and modeling of call center arrivals. WSC 2014: 476-485 - [i2]Maria Vlasiou, Jiheng Zhang, Bert Zwart:
Separation of timescales in a two-layered network. CoRR abs/1404.6924 (2014) - [i1]Varun Gupta, Jiheng Zhang:
Approximations and Optimal Control for State-dependent Limited Processor Sharing Queues. CoRR abs/1409.0153 (2014) - 2013
- [j4]Jun Luo, Jiheng Zhang:
Staffing and Control of Instant Messaging Contact Centers. Oper. Res. 61(2): 328-343 (2013) - [j3]Jiheng Zhang:
Fluid models of many-server queues with abandonment. Queueing Syst. Theory Appl. 73(2): 147-193 (2013) - 2012
- [c1]Maria Vlasiou, Jiheng Zhang, Bert Zwart, Rob van der Mei:
Separation of timescales in a two-layered network. ITC 2012: 1-8
2000 – 2009
- 2009
- [j2]Jiheng Zhang, Jim G. Dai, Bert Zwart:
Law of Large Number Limits of Limited Processor-Sharing Queues. Math. Oper. Res. 34(4): 937-970 (2009) - 2008
- [j1]Jiheng Zhang, Bert Zwart:
Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Syst. Theory Appl. 60(3-4): 227-246 (2008)
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 20:31 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:
