default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNahum Shimkin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Michal Golan, Nahum Shimkin:
Markov decision processes with burstiness constraints. Eur. J. Oper. Res. 312(3): 877-889 (2024)- 2023
- [i9]Daniel Segal, Aharon Bar-Gill, Nahum Shimkin:
Altitude-Loss Optimal Glides in Engine Failure Emergencies - Accounting for Ground Obstacles and Wind. CoRR abs/2304.06499 (2023) - 2021
- [c44]Nir Greshler
, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. MRS 2021: 20-28 - [c43]Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. SOCS 2021: 173-175 - [i8]Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. CoRR abs/2105.10993 (2021) - 2020
- [j43]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) - [c42]Yair Shemer, Daniel Rotman, Nahum Shimkin:
ILS-SUMM: Iterated Local Search for Unsupervised Video Summarization. ICPR 2020: 1259-1266
2010 – 2019
- 2019
- [i7]Yair Shemer, Daniel Rotman, Nahum Shimkin:
ILS-SUMM: Iterated Local Search for Unsupervised Video Summarization. CoRR abs/1912.03650 (2019) - 2018
- [c41]Yahel David, Balázs Szörényi, Mohammad Ghavamzadeh, Shie Mannor, Nahum Shimkin:
PAC Bandits with Risk Constraints. ISAIM 2018 - 2017
- [j42]Sandeep Juneja, Nahum Shimkin:
On the Computation of Dynamic User Equilibrium in the Multiclass Transient Fluid Queue. SIGMETRICS Perform. Evaluation Rev. 45(3): 137-142 (2017) - [c40]Oron Anschel, Nir Baram, Nahum Shimkin:
Averaged-DQN: Variance Reduction and Stabilization for Deep Reinforcement Learning. ICML 2017: 176-185 - [i6]Ayal Taitler, Nahum Shimkin:
Learning Control for Air Hockey Striking using Deep Reinforcement Learning. CoRR abs/1702.08074 (2017) - 2016
- [j41]Eitan Altman, Nahum Shimkin:
The Ordered Timeline Game: Strategic Posting Times Over a Temporally Ordered Shared Medium. Dyn. Games Appl. 6(4): 429-455 (2016) - [j40]Nahum Shimkin:
An Online Convex Optimization Approach to Blackwell's Approachability. J. Mach. Learn. Res. 17: 129:1-129:23 (2016) - [c39]Yahel David, Nahum Shimkin:
PAC Lower Bounds and Efficient Algorithms for The Max \(K\)-Armed Bandit Problem. ICML 2016: 878-887 - [c38]Yahel David, Nahum Shimkin:
Pure Exploration for Max-Quantile Bandits. ECML/PKDD (1) 2016: 556-571 - [i5]Oron Anschel, Nir Baram, Nahum Shimkin:
Deep Reinforcement Learning with Averaged Target DQN. CoRR abs/1611.01929 (2016) - 2015
- [j39]Andrey Bernstein, Nahum Shimkin:
Response-based approachability with applications to generalized no-regret problems. J. Mach. Learn. Res. 16: 747-773 (2015) - [c37]Yahel David, Nahum Shimkin:
Refined Algorithms for Infinitely Many-Armed Bandits with Deterministic Rewards. ECML/PKDD (1) 2015: 464-479 - [i4]Nahum Shimkin:
An Online Convex Optimization Approach to Blackwell's Approachability. CoRR abs/1503.00255 (2015) - [i3]Yahel David, Nahum Shimkin:
The Max K-Armed Bandit: A PAC Lower Bound and tighter Algorithms. CoRR abs/1508.05608 (2015) - [i2]Yahel David, Nahum Shimkin:
The Max $K$-Armed Bandit: PAC Lower Bounds and Efficient Algorithms. CoRR abs/1512.07650 (2015) - 2014
- [j38]Rami Atar, Haya Kaspi, Nahum Shimkin:
Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy. Math. Oper. Res. 39(3): 672-696 (2014) - [j37]Andrey Bernstein, Shie Mannor, Nahum Shimkin:
Opportunistic Approachability and Generalized No-Regret Problems. Math. Oper. Res. 39(4): 1057-1083 (2014) - [c36]Eitan Altman, Nahum Shimkin:
Strategic posting times over a shared publication medium. NetGCooP 2014: 150-157 - [c35]Yahel David, Nahum Shimkin:
Infinitely Many-Armed Bandits with Unknown Value Distribution. ECML/PKDD (1) 2014: 307-322 - 2013
- [j36]Sandeep Juneja, Nahum Shimkin:
The concert queueing game: strategic arrivals with waiting and tardiness costs. Queueing Syst. Theory Appl. 74(4): 369-402 (2013) - [c34]Andrey Bernstein, Shie Mannor, Nahum Shimkin:
Opportunistic Strategies for Generalized No-Regret Problems. COLT 2013: 158-171 - [i1]Andrey Bernstein, Nahum Shimkin:
Response-Based Approachability and its Application to Generalized No-Regret Algorithms. CoRR abs/1312.7658 (2013) - 2012
- [j35]Gideon F. Inbar, Nahum Shimkin, Per Olof Gutman:
In memoriam Raphael Sivan, 1935-2011. Autom. 48(11): 2739 (2012) - [c33]Sandeep Juneja, Tushar Raheja, Nahum Shimkin:
The concert queueing game with a random volume of arrivals. VALUETOOLS 2012: 317-325 - 2011
- [j34]Dirk P. Kroese, Nahum Shimkin, Joseph Kreimer, Sandeep Juneja:
Preface. Ann. Oper. Res. 189(1): 1-3 (2011) - [j33]Rahul Jain, Sandeep Juneja, Nahum Shimkin:
The concert queueing game: to wait or to be late. Discret. Event Dyn. Syst. 21(1): 103-138 (2011) - [j32]Rami Atar, Chanit Giat, Nahum Shimkin:
On the asymptotic optimality of the cμ/θ rule under ergodic cost. Queueing Syst. Theory Appl. 67(2): 127-144 (2011) - [j31]Daniel Sigalov, Nahum Shimkin:
Cross Entropy Algorithms for Data Association in Multi-Target Tracking. IEEE Trans. Aerosp. Electron. Syst. 47(2): 1166-1185 (2011) - [j30]Tansu Alpcan, Rachid El Azouzi, Nahum Shimkin, Laura Wynter:
Guest Editorial - Special Issue on Game Theory in Communication Networks. Telecommun. Syst. 47(1-2): 1-2 (2011) - [j29]Ishai Menache, Nahum Shimkin:
Reservation-based distributed medium access in wireless collision channels. Telecommun. Syst. 47(1-2): 95-108 (2011) - [c32]Kfir Y. Levy, Nahum Shimkin:
Unified Inter and Intra Options Learning Using Policy Gradient Methods. EWRL 2011: 153-164 - [c31]Ishai Menache, Asuman E. Ozdaglar, Nahum Shimkin:
Socially optimal pricing of cloud computing resources. VALUETOOLS 2011: 322-331 - 2010
- [j28]Rami Atar, Chanit Giat, Nahum Shimkin:
The cµ/theta Rule for Many-Server Queues with Abandonment. Oper. Res. 58(5): 1427-1439 (2010) - [j27]Andrey Bernstein, Nahum Shimkin:
Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains. Mach. Learn. 81(3): 359-397 (2010) - [j26]Tijani Chahed, Luciano Lenzini, Nahum Shimkin:
Preface. Perform. Evaluation 67(4): 199-200 (2010) - [j25]Semyon M. Meerkov, Nahum Shimkin, Liang Zhang:
Transient Behavior of Two-Machine Geometric Production Lines. IEEE Trans. Autom. Control. 55(2): 453-458 (2010) - [c30]Andrey Bernstein, Shie Mannor, Nahum Shimkin:
Online Classification with Specificity Constraints. NIPS 2010: 190-198
2000 – 2009
- 2009
- [j24]Mor Armony, Nahum Shimkin, Ward Whitt:
The Impact of Delay Announcements in Many-Server Queues with Abandonment. Oper. Res. 57(1): 66-81 (2009) - [j23]Jia Yuan Yu, Shie Mannor, Nahum Shimkin:
Markov Decision Processes with Arbitrary Reward Processes. Math. Oper. Res. 34(3): 737-757 (2009) - 2008
- [j22]Shie Mannor, Nahum Shimkin:
Regret minimization in repeated matrix games with variable stage duration. Games Econ. Behav. 63(1): 227-258 (2008) - [j21]Ishai Menache, Nahum Shimkin:
Rate-Based Equilibria in Collision Channels with Fading. IEEE J. Sel. Areas Commun. 26(7): 1070-1077 (2008) - [j20]Ishai Menache, Nahum Shimkin:
Capacity management and equilibrium for proportional QoS. IEEE/ACM Trans. Netw. 16(5): 1025-1037 (2008) - [c29]Andrey Bernstein, Nahum Shimkin:
Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains. COLT 2008: 323-334 - [c28]Kirill Dyagilev, Shie Mannor, Nahum Shimkin:
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case. EWRL 2008: 41-54 - [c27]Jia Yuan Yu, Shie Mannor, Nahum Shimkin:
Markov Decision Processes with Arbitrary Reward Processes. EWRL 2008: 268-281 - [c26]Ishai Menache, Nahum Shimkin:
Decentralized Rate Regulation in Random Access Channels. INFOCOM 2008: 394-402 - [c25]Ishai Menache, Nahum Shimkin:
Efficient Rate-Constrained Nash Equilibrium in Collision Channels with State Information. INFOCOM 2008: 403-411 - [c24]Ishai Menache, Nahum Shimkin:
Noncooperative power control and transmission scheduling in wireless collision channels. SIGMETRICS 2008: 349-358 - [c23]Ishai Menache, Nahum Shimkin:
Reservation-based distributed medium access in wireless collision channels. VALUETOOLS 2008: 9 - [c22]Daniel Sigalov, Nahum Shimkin:
Cross-entropy based data association for multi target tracking. VALUETOOLS 2008: 30 - [c21]Rami Atar, Chanit Giat, Nahum Shimkin:
The cμ/θ rule. VALUETOOLS 2008: 58 - [c20]Kirill Dyagilev, Shie Mannor, Nahum Shimkin:
Efficient reinforcement learning in parameterized models: discrete parameters. VALUETOOLS 2008: 64 - 2007
- [j19]Oran Richman, Nahum Shimkin:
Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users. Math. Oper. Res. 32(1): 215-232 (2007) - [c19]Ishai Menache, Nahum Shimkin:
Fixed-Rate Equilibrium in Wireless Collision Channels. NET-COOP 2007: 23-32 - [c18]Nahum Shimkin:
A Survey of Uniqueness Results for Selfish Routing. NET-COOP 2007: 33-42 - 2006
- [c17]Ishai Menache, Nahum Shimkin:
Capacity Assignment for Proportional QoS in Diffserv-Like Networks. CDC 2006: 1278-1283 - [c16]Shie Mannor, Nahum Shimkin:
Online Learning with Variable Stage Duration. COLT 2006: 408-422 - 2005
- [j18]Ishai Menache, Shie Mannor, Nahum Shimkin:
Basis Function Adaptation in Temporal Difference Reinforcement Learning. Ann. Oper. Res. 134(1): 215-238 (2005) - [c15]O. Ziv, Nahum Shimkin:
Multigrid Methods for Policy Evaluation and Reinforcement Learning. ISIC 2005: 1391-1396 - [c14]Oran Richman, Nahum Shimkin:
Uniqueness of the Nash Equilibrium in Convex Routing Games: Topological Conditions. CDC/ECC 2005: 5330-5335 - [c13]Eran D. Pinhasov, Nahum Shimkin, Yehoshua Y. Zeevi:
Optimal usage of color for disparity estimation in stereo vision. EUSIPCO 2005: 1-4 - [c12]Ishai Menache, Nahum Shimkin:
Proportional QoS in Differentiated Services Networks: Capacity Management, Equilibrium Analysis and Elastic Demands. WINE 2005: 728-737 - 2004
- [j17]Shie Mannor, Nahum Shimkin:
A Geometric Approach to Multi-Criterion Reinforcement Learning. J. Mach. Learn. Res. 5: 325-360 (2004) - [j16]Nahum Shimkin, Avishai Mandelbaum:
Rational Abandonment from Tele-Queues: Nonlinear Waiting Costs with Heterogeneous Preferences. Queueing Syst. Theory Appl. 47(1-2): 117-146 (2004) - 2003
- [j15]Reuven Zaritsky, Natan Peterfreund, Nahum Shimkin:
Velocity-Guided Tracking of Deformable Contours in Three Dimensional Space. Int. J. Comput. Vis. 51(3): 219-238 (2003) - [j14]Shie Mannor, Nahum Shimkin:
The Empirical Bayes Envelope and Regret Minimization in Competitive Markov Decision Processes. Math. Oper. Res. 28(2): 327-345 (2003) - [j13]Matthew W. Jacobson, Nahum Shimkin, Adam Shwartz:
Markov Decision Processes with Slow Scale Periodic Decisions. Math. Oper. Res. 28(4): 777-800 (2003) - [c11]Shie Mannor, Nahum Shimkin:
On-Line Learning with Imperfect Monitoring. COLT 2003: 552-566 - [c10]Gozde B. Unal, Delphine Nain, Gérard Ben Arous, Nahum Shimkin, Allen R. Tannenbaum, Ofer Zeitouni:
Algorithms for stochastic approximations of curvature flows. ICIP (2) 2003: 651-654 - 2002
- [j12]Ety Zohar, Avishai Mandelbaum, Nahum Shimkin:
Adaptive Behavior of Impatient Customers in Tele-Queues: Theory and Empirical Support. Manag. Sci. 48(4): 566-583 (2002) - [j11]Eitan Altman, Tamer Basar, Tania Jiménez, Nahum Shimkin:
Competitive routing in networks with polynomial costs. IEEE Trans. Autom. Control. 47(1): 92-96 (2002) - [c9]Ishai Menache, Shie Mannor, Nahum Shimkin:
Q-Cut - Dynamic Discovery of Sub-goals in Reinforcement Learning. ECML 2002: 295-306 - 2001
- [j10]Eitan Altman, Tamer Basar, Tania Jiménez, Nahum Shimkin:
Routing into Two Parallel Links: Game-Theoretic Distributed Algorithms. J. Parallel Distributed Comput. 61(9): 1367-1381 (2001) - [c8]Shie Mannor, Nahum Shimkin:
Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments. COLT/EuroCOLT 2001: 128-142 - [c7]Shie Mannor, Nahum Shimkin:
The Steering Approach for Multi-Criteria Reinforcement Learning. NIPS 2001: 1563-1570 - 2000
- [j9]Israel Ben-Shahar, Ariel Orda, Nahum Shimkin:
Dynamic service sharing with heterogeneous preferences. Queueing Syst. Theory Appl. 35(1-4): 83-103 (2000) - [j8]Eitan Altman, Ariel Orda, Nahum Shimkin:
Bandwidth allocation for guaranteed versus best effort service categories. Queueing Syst. Theory Appl. 36(1-3): 89-105 (2000) - [j7]Avishai Mandelbaum, Nahum Shimkin:
A model for rational abandonments from invisible queues. Queueing Syst. Theory Appl. 36(1-3): 141-173 (2000) - [j6]Ariel Orda, Nahum Shimkin:
Incentive pricing in multiclass systems. Telecommun. Syst. 13(2-4): 241-267 (2000) - [c6]Reuven Zaritsky, Natan Peterfreund, Nahum Shimkin:
Velocity-Guided Tracking of Deformable Contours in Three Dimensional Space. ECCV (1) 2000: 251-266 - [c5]Eitan Altman, Tamer Basar, Tania Jiménez, Nahum Shimkin:
Competitive Routing in Networks with Polynomial Cost. INFOCOM 2000: 1586-1593
1990 – 1999
- 1999
- [c4]Israel Ben-Shahar, Ariel Orda, Nahum Shimkin:
Best-Effort Resource Sharing by Users with QoS Requirements. INFOCOM 1999: 883-890 - 1998
- [j5]Eitan Altman, Nahum Shimkin:
Individual Equilibrium and Learning in Processor Sharing Systems. Oper. Res. 46(6): 776-784 (1998) - [c3]Eitan Altman, Ariel Orda, Nahum Shimkin:
Bandwidth Allocation for Guaranteed versus Best Effort Service Categories. INFOCOM 1998: 617-624 - 1997
- [c2]Ariel Orda, Nahum Shimkin:
Incentive Pricing in Multi-Class Communication Networks. INFOCOM 1997: 659-666 - 1996
- [j4]Nahum Shimkin, Adam Shwartz:
Asymptotically Efficient Adaptive Strategies in Repeated Games Part II. Asymptotic Optimality. Math. Oper. Res. 21(2): 487-512 (1996) - 1995
- [j3]Nahum Shimkin, Adam Shwartz:
Asymptotically Efficient Adaptive Strategies in Repeated Games Part I: Certainty Equivalence Strategies. Math. Oper. Res. 20(3): 743-767 (1995) - 1993
- [j2]Nahum Shimkin, Adam Shwartz:
Guaranteed performance regions in Markovian systems with competing decision makers. IEEE Trans. Autom. Control. 38(1): 84-95 (1993) - [j1]Ariel Orda, Raphael Rom, Nahum Shimkin:
Competitive routing in multiuser communication networks. IEEE/ACM Trans. Netw. 1(5): 510-521 (1993) - [c1]Ariel Orda, Raphael Rom, Nahum Shimkin:
Competitive Routing in Multi-User Communication Networks. INFOCOM 1993: 964-971
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 2025-01-21 00:02 CET 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:
