相关论文: Many greedy cleaners in a Poisson environment

The one-dimensional three-state cyclic cellular automaton is a simple spatial model with three states in a cyclic "rock-paper-scissors" prey-predator relationship. Starting from a random configuration, similar states gather in increasingly…

This work addresses the problem of exploration in an unknown environment. For linear dynamical systems, we use an experimental design framework and introduce an online greedy policy where the control maximizes the information of the next…

In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones,…

In the supermarket model, there are $n$ queues, each with a single server. Customers arrive in a Poisson process with arrival rate $\lambda n$, where $\lambda = \lambda (n) \in (0,1)$. Upon arrival, a customer selects $d=d(n)$ servers…

We expand the item response theory to study the case of "cheating students" for a set of exams, trying to detect them by applying a greedy algorithm of inference. This extended model is closely related to the Boltzmann machine learning. In…

We consider a service system model primarily motivated by the problem of efficient assignment of virtual machines to physical host machines in a network cloud, so that the number of occupied hosts is minimized. There are multiple types of…

Shared resources enhance productivity yet at the same time provide channels for biological and digital contamination, turning physical or digital hygiene into a cooperation dilemma prone to free-riding. Here we introduce a game of…

The work presents a proof of convergence of the density of energy levels to a Gaussian distribution for a wide class of quadratic forms of Fermi operators. This general result applies also to quadratic operators with disorder, e.g.,…

We construct an extension of the Lambda-coalescent to a spatial continuum and analyse its behaviour. Like the Lambda-coalescent, the individuals in our model can be separated into (i) a dust component and (ii) large blocks of coalesced…

We study a fundamental problem in Bayesian learning, where the goal is to select a set of data sources with minimum cost while achieving a certain learning performance based on the data streams provided by the selected data sources. First,…

Consider the Hitting Set problem where, for a given universe $\mathcal{X} = \left\{ 1, ... , n \right\}$ and a collection of subsets $\mathcal{S}_1, ... , \mathcal{S}_m$, one seeks to identify the smallest subset of $\mathcal{X}$ which has…

We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…

Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…

We show that a scaling approach successfully characterizes clustering and intermittency in space and time, in systems of noninteracting particles driven by fluctuating surfaces. We study both the steady state and the approach to it, for…

Random partition models are widely used in Bayesian methods for various clustering tasks, such as mixture models, topic models, and community detection problems. While the number of clusters induced by random partition models has been…

We consider an infinite balls-into-bins process with deletions where in each discrete step $t$ a coin is tossed as to whether, with probability $\beta(t) \in (0,1)$, a new ball is allocated using the Greedy[2] strategy (which places the…

Most practical scheduling applications involve some uncertainty about the arriving times and lengths of the jobs. Stochastic online scheduling is a well-established model capturing this. Here the arrivals occur online, while the processing…

There are two types $i=1,2$ of particles on the line $R$, with $N_{i}$ particles of type $i$. Each particle of type $i$ moves with constant velocity $v_{i}$. Moreover, any particle of type $i=1,2$ jumps to any particle of type $j=1,2$ with…

This paper presents two real-world scheduling problems and their algorithmic solutions through polynomial-time reductions. First, we address the Hospital Patient-to-Bed Assignment problem, demonstrating its reduction to Maximum Bipartite…

The cosparse analysis model has been introduced recently as an interesting alternative to the standard sparse synthesis approach. A prominent question brought up by this new construction is the analysis pursuit problem -- the need to find a…