Shimkin Nahum

Nahum Shimkin

Information about the author Nahum Shimkin will soon be added to the site.
Found 12 papers in total
The Ordered Timeline Game: Strategic Posting Times Over a Temporally Ordered Shared Medium
The Ordered Timeline Game: Strategic Posting Times Over a Temporally Ordered Shared Medium
2016
We consider a game of timing between a random number of content creators, who compete...
The concert queueing game: strategic arrivals with waiting and tardiness costs
The concert queueing game: strategic arrivals with waiting and tardiness costs
2013
We consider the noncooperative choice of arrival times by individual users, who seek...
On the asymptotic optimality of the cμ/θ rule under ergodic cost
On the asymptotic optimality of the cμ/θ rule under ergodic cost
2011
We consider an overloaded multi‐server multi‐class queueing model where...
The cμ/θ Rule for Many-Server Queues with Abandonment
The cμ/θ Rule for Many-Server Queues with Abandonment
2010
We consider a multiclass queueing system with multiple homogeneous servers and...
Topological uniqueness of the Nash equilibrium for selfish routing with atomic users
Topological uniqueness of the Nash equilibrium for selfish routing with atomic users
2007
We consider the problem of selfish routing in a congested network shared by several...
Basis function adaptation in temporal difference reinforcement learning
Basis function adaptation in temporal difference reinforcement learning
2005
Reinforcement Learning (RL) is an approach for solving complex multi-stage decision...
A model for rational abandonments from invisible queues
A model for rational abandonments from invisible queues
2000
We propose a model for abandonments from a queue, due to excessive wait, assuming that...
Adaptive behavior of impatient customers in tele-queues: Theory and empirical support
Adaptive behavior of impatient customers in tele-queues: Theory and empirical support
2002
We address the modeling and analysis of abandonments from a queue that is invisible to...
Dynamic service sharing with heterogeneous preferences
Dynamic service sharing with heterogeneous preferences
2000
We consider a service system where individual users share a common resource, modeled...
Bandwidth allocation for guaranteed versus best effort service categories
Bandwidth allocation for guaranteed versus best effort service categories
2000
Modern communication networks evolve towards integration of guaranteed-performance and...
A model for rational abandonments from invisible queues
A model for rational abandonments from invisible queues
2000
We propose a model for abandonments from a queue, due to excessive wait, assuming that...
Individual equilibrium and learning in processor sharing systems
Individual equilibrium and learning in processor sharing systems
1998
We consider a processor-sharing service system, where the service rate to individual...
Papers per page: