Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Zubeldía, Martín"'
We consider a large-scale parallel-server system, where each server independently adjusts its processing speed in a decentralized manner. The objective is to minimize the overall cost, which comprises the average cost of maintaining the servers' proc
Externí odkaz:
http://arxiv.org/abs/2306.02215
In this paper, we establish maximal concentration bounds for the iterates generated by a stochastic approximation (SA) algorithm under a contractive operator with respect to some arbitrary norm (for example, the $\ell_\infty$-norm). We consider two s
Externí odkaz:
http://arxiv.org/abs/2303.15740
We consider a load balancing system comprised of a fixed number of single server queues, operating under the well-known Join-the-Shortest Queue policy, and where jobs/customers are impatient and abandon if they do not receive service after some (rand
Externí odkaz:
http://arxiv.org/abs/2211.15050
Inspired by quantum switches, we consider a discrete-time multi-way matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes, and qubits from each node that can be used to serve the requests. An important
Externí odkaz:
http://arxiv.org/abs/2209.12324
Autor:
Zubeldia, Martin, Mandjes, Michel
We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive drifts, which
Externí odkaz:
http://arxiv.org/abs/2008.12999
We consider a heterogeneous distributed service system, consisting of $n$ servers with unknown and possibly different processing rates. Jobs with unit mean and independent processing times arrive as a renewal process of rate $\lambda n$, with $0<\lam
Externí odkaz:
http://arxiv.org/abs/2007.07219
Autor:
Zubeldia, Martin
We consider a large distributed service system consisting of $n$ homogeneous servers with infinite capacity FIFO queues. Jobs arrive as a Poisson process of rate $\lambda n/k_n$ (for some positive constant $\lambda$ and integer $k_n$). Each incoming
Externí odkaz:
http://arxiv.org/abs/1910.09602
We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual learns the best option if eventually (as $t\to \infty$) it pulls only
Externí odkaz:
http://arxiv.org/abs/1811.03968
We consider the following distributed service model: jobs with unit mean, general distribution, and independent processing times arrive as a renewal process of rate $\lambda n$, with $0<\lambda<1$, and are immediately dispatched to one of several que
Externí odkaz:
http://arxiv.org/abs/1807.02882
We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual learns the best option if eventually (as $t \to \infty$) it pulls onl
Externí odkaz:
http://arxiv.org/abs/1802.08159