Related papers: Stability of the Greedy Algorithm on the Circle

We have studied numerically the statistical mechanics of the dynamic phenomena, including money circulation and economic mobility, in some transfer models. The models on which our investigations were performed are the basic model proposed…

The frame algorithm uses a simple recursive formula to approximate an unknown vector from its frame coefficients. This note introduces an adaptive version of the frame algorithm that maximizes the error reduction between steps in terms of…

In this paper, we analyze a polling system on a circle. Random batches of customers arrive at a circle, where each customer, independently, obtains a uniform location. A single server cyclically travels over the circle to serve all…

The contextual bandit literature has traditionally focused on algorithms that address the exploration-exploitation tradeoff. In particular, greedy algorithms that exploit current estimates without any exploration may be sub-optimal in…

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $\lambda\geqslant 1$. We introduce the so-called $\lambda$-almost greedy and…

In this paper, we study a matching market model on a bipartite network where agents on each side arrive and depart stochastically by a Poisson process. For such a dynamic model, we design a mechanism that decides not only which agents to…

We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic…

In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times).…

A key problem in emerging complex cyber-physical networks is the design of information and control topologies, including sensor and actuator selection and communication network design. These problems can be posed as combinatorial set…

We present a fast two-phase algorithm for super-resolution with strong theoretical guarantees. Given the low-frequency part of the spectrum of a sequence of impulses, Phase I consists of a greedy algorithm that roughly estimates the impulse…

We characterize the stability, metastability, and the stationary regime of traffic dynamics in a single-cell uplink wireless system. The traffic is represented in terms of spatial birth-death processes, in which users arrive as a Poisson…

Although the basic idea behind the concept of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [S.~V.~Konyagin and V.~N.~Temlyakov, A…

We consider a network topology design problem in which an initial undirected graph underlying the network is given and the objective is to select a set of edges to add to the graph to optimize the coherence of the resulting network. We show…

We prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new ingredient of the paper is that we bound the…

In recent years, ridesharing platforms have become a prominent mode of transportation for the residents of urban areas. As a fundamental problem, route recommendation for these platforms is vital for their sustenance. The works done in this…

When people choose routes minimizing their individual delay, the aggregate congestion can be much higher compared to that experienced by a centrally-imposed routing. Yet centralized routing is incompatible with the presence of…

We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and…

We study the robustness of GreedyCC, GreedyPAV, and Phargmen's sequential rule, using the framework introduced by Bredereck et al. for the case of (multiwinner) ordinal elections and adopted to the approval setting by Gawron and…

A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modeled as static balls into bins processes, where $m$ balls (tasks)…

In this paper we consider greedy scheduling algorithms in wireless networks, i.e., the schedules are computed by adding links greedily based on some priority vector. Two special cases are considered: 1) Longest Queue First (LQF) scheduling,…