default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael N. Katehakis
Person information
- affiliation: Rutgers University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i7]Wesley Cowan, Michael N. Katehakis, Sheldon M. Ross:
Optimal Activation of Halting Multi-Armed Bandit Models. CoRR abs/2304.10302 (2023)- 2022
- [j33]Eugene A. Feinberg, Michael N. Katehakis, Floske Spieksma:
Probability methods in business and industry in honor of Benjamin Avi-Itzhak and Matthew J. Sobel. Ann. Oper. Res. 317(1): 1-4 (2022) - [j32]Dhammika Amaratunga
, Javier Cabrera, Debopriya Ghosh, Michael N. Katehakis, Jin Wang, Wenting Wang:
Socio-economic impact on COVID-19 cases and deaths and its evolution in New Jersey. Ann. Oper. Res. 317(1): 5-18 (2022) - [j31]Michael N. Katehakis, Yifeng Liu, Jian Yang:
A revisit to the markup practice of irreversible dynamic pricing. Ann. Oper. Res. 317(1): 77-105 (2022) - [j30]Stella Kapodistria, Michael N. Katehakis, Sheldon M. Ross, Floske Spieksma:
Stochastic models and algorithms dedicated to the 60th birthday of Professor Eugene A. Feinberg. Ann. Oper. Res. 317(2): 331-333 (2022) - [j29]Michael N. Katehakis, Benjamin Melamed, Junmin Shi:
Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost. Ann. Oper. Res. 317(2): 665-691 (2022) - [j28]Mehdi Davoodi, Michael N. Katehakis, Jian Yang:
Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution. Oper. Res. 70(3): 1560-1576 (2022) - [j27]Konstantinos Skitsas, Ioannis G. Papageorgiou, Mohammad Sadegh Talebi, Vasiliki Kantere, Michael N. Katehakis, Panagiotis Karras:
SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs. Proc. VLDB Endow. 16(1): 90-98 (2022) - 2021
- [j26]Wen Chen, Odysseas Kanavetas, Michael N. Katehakis:
Ameso optimization: A relaxation of discrete midpoint convexity. Discret. Appl. Math. 293: 177-192 (2021) - [j25]Michael N. Katehakis, Kartikeya S. Puranam:
On the evaluation of bidding strategies in sequential auctions. Oper. Res. Lett. 49(6): 829-836 (2021) - 2020
- [j24]Michael N. Katehakis, Jian Yang, Tingting Zhou:
Dynamic Inventory and Price Controls Involving Unknown Demand on Discrete Nonperishable Items. Oper. Res. 68(5): 1335-1355 (2020)
2010 – 2019
- 2019
- [i6]Wesley Cowan, Michael N. Katehakis, Daniel Pirutinsky:
Reinforcement Learning: a Comparison of UCB Versus Alternative Adaptive Policies. CoRR abs/1909.06019 (2019) - [i5]Wesley Cowan, Michael N. Katehakis, Daniel Pirutinsky:
Accelerating the Computation of UCB and Related Indices for Reinforcement Learning. CoRR abs/1909.13158 (2019) - 2018
- [c4]Michael N. Katehakis:
On Markov Decision Processes with Pseudo-Boolean Reward Functions. ISAIM 2018 - [i4]Apostolos N. Burnetas, Odysseas Kanavetas, Michael N. Katehakis:
Asymptotically Optimal Multi-Armed Bandit Activation Policies under Side Constraints. CoRR abs/1811.12852 (2018) - 2017
- [j23]Wesley Cowan, Junya Honda, Michael N. Katehakis:
Normal Bandits of Unknown Means and Variances. J. Mach. Learn. Res. 18: 154:1-154:28 (2017) - 2016
- [j22]Michael N. Katehakis, Sheldon M. Ross, Jian Yang:
Preface: Optimization under uncertainty - costs, risks and revenues Cyrus Derman memorial volume II. Ann. Oper. Res. 241(1-2): 1 (2016) - [j21]Michael N. Katehakis, Laurens C. Smit, Floske Spieksma:
A comparative analysis of the successive lumping and the lattice path counting algorithms. J. Appl. Probab. 53(1): 106-120 (2016) - 2015
- [i3]Wesley Cowan, Michael N. Katehakis:
Normal Bandits of Unknown Means and Variances: Asymptotic Optimality, Finite Horizon Regret Bounds, and a Solution to an Open Problem. CoRR abs/1504.05823 (2015) - [i2]Wesley Cowan, Michael N. Katehakis:
An Asymptotically Optimal UCB Policy for Uniform Bandits of Unknown Support. CoRR abs/1505.01918 (2015) - [i1]Wesley Cowan, Michael N. Katehakis:
Asymptotic Behavior of Minimal-Exploration Allocation Policies: Almost Sure, Arbitrarily Slow Growing Regret. CoRR abs/1505.02865 (2015) - 2014
- [j20]Kartikeya S. Puranam, Michael N. Katehakis:
On optimal bidding and inventory control in sequential procurement auctions: the multi period case. Ann. Oper. Res. 217(1): 447-462 (2014) - [j19]Kartikeya S. Puranam, Michael N. Katehakis:
On optimising taboo criteria in Markov decision processes. Int. J. Appl. Decis. Sci. 7(1): 33-43 (2014) - [j18]Jim (Junmin) Shi, Michael N. Katehakis, Benjamin Melamed, Yusen Xia:
Production-Inventory Systems with Lost Sales and Compound Poisson Demands. Oper. Res. 62(5): 1048-1063 (2014) - 2013
- [j17]Michael N. Katehakis, Sheldon M. Ross, Jian Yang:
Optimization under uncertainty: costs, risks and revenues Cyrus Derman memorial volume I. Ann. Oper. Res. 208(1): 1 (2013) - [j16]Michael N. Katehakis, Ingram Olkin, Sheldon M. Ross, Jian Yang:
On the life and work of Cyrus Derman. Ann. Oper. Res. 208(1): 5-26 (2013) - [j15]Junmin Shi, Michael N. Katehakis, Benjamin Melamed:
Martingale methods for pricing inventory penalties under continuous replenishment and compound renewal demands. Ann. Oper. Res. 208(1): 593-612 (2013) - [j14]Madjid Tavana, Faramak Zandi, Michael N. Katehakis:
A hybrid fuzzy group ANP-TOPSIS framework for assessment of e-government readiness from a CiRM perspective. Inf. Manag. 50(7): 383-397 (2013) - 2012
- [j13]Michael N. Katehakis, Laurens C. Smit:
On computing optimal (Q, r) replenishment policies under quantity discounts - The all-units and incremental discount cases. Ann. Oper. Res. 200(1): 279-298 (2012) - [j12]Michael N. Katehakis, Kartikeya S. Puranam:
On bidding for a fixed number of items in a sequence of auctions. Eur. J. Oper. Res. 222(1): 76-84 (2012) - [j11]Michael N. Katehakis, Kartikeya S. Puranam:
On optimal bidding in sequential procurement auctions. Oper. Res. Lett. 40(4): 244-249 (2012)
2000 – 2009
- 2009
- [j10]Bin Zhou, Michael N. Katehakis, Yao Zhao:
Managing stochastic inventory systems with free shipping option. Eur. J. Oper. Res. 196(1): 186-197 (2009) - 2008
- [j9]Victoria Ungureanu, Benjamin Melamed, Michael N. Katehakis:
Effective load balancing for cluster-based servers employing job preemption. Perform. Evaluation 65(8): 606-622 (2008) - 2007
- [j8]Phillip G. Bradford, Michael N. Katehakis:
A Probabilistic Study on Combinatorial Expanders and Hashing. SIAM J. Comput. 37(1): 83-111 (2007) - 2006
- [j7]Victoria Ungureanu, Benjamin Melamed, Michael N. Katehakis, Phillip G. Bradford:
Deferred Assignment Scheduling in Cluster-Based Servers. Clust. Comput. 9(1): 57-65 (2006) - 2004
- [c3]Victoria Ungureanu, Benjamin Melamed, Michael N. Katehakis:
The LC Assignment Policy for Cluster-Based Servers. NCA 2004: 177-184 - [c2]Victoria Ungureanu, Benjamin Melamed, Phillip G. Bradford, Michael N. Katehakis:
Class-Dependent Assignment in cluster-based servers. SAC 2004: 1420-1425 - 2003
- [c1]Victoria Ungureanu, Benjamin Melamed, Michael N. Katehakis:
Towards an Efficient Cluster-Based E-Commerce Server. CLUSTER 2003: 474-477
1990 – 1999
- 1997
- [j6]Apostolos Burnetas, Michael N. Katehakis:
On confidence intervals from simulation of finite Markov chains. Math. Methods Oper. Res. 46(2): 241-250 (1997) - [j5]Apostolos N. Burnetas, Michael N. Katehakis:
Optimal Adaptive Policies for Markov Decision Processes. Math. Oper. Res. 22(1): 222-255 (1997)
1980 – 1989
- 1987
- [j4]Michael N. Katehakis, Arthur F. Veinott Jr.:
The Multi-Armed Bandit Problem: Decomposition and Computation. Math. Oper. Res. 12(2): 262-268 (1987) - 1986
- [j3]Michael N. Katehakis, Alan Levine:
Allocation of distinguishable servers. Comput. Oper. Res. 13(1): 85-93 (1986) - [j2]Yih Ren Chen, Michael N. Katehakis:
Linear Programming for Finite State Multi-Armed Bandit Problems. Math. Oper. Res. 11(1): 180-183 (1986) - 1984
- [j1]Michael N. Katehakis, Cyrus Derman:
Optimal Repair Allocation in a Series System. Math. Oper. Res. 9(4): 615-623 (1984)
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-07 21:17 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:
