Preprint · 2015 · Open access

Online Budgeted Repeated Matching

Ajil Jalal, Rahul Vaze, Umang Bhaskar

arXiv (Cornell University) · Published 1 December 2015 · DOI 10.48550/arxiv.1512.00153

Open PDFView at the publisherCite this paper

In brief

“Online Budgeted Repeated Matching” is a 2015 preprint by Ajil Jalal and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
0
References
26
Authors
3

Abstract

A basic combinatorial online resource allocation problem is considered, where multiple servers have individual capacity constraints, and at each time slot, a set of jobs arrives, that have potentially different weights to different servers. At each time slot, a one-to-one matching has to be found between jobs and servers, subject to individual capacity constraints, in an online manner. The objective is to maximize the aggregate weight of jobs allotted to servers, summed across time slots and servers, subject to individual capacity constraints. This problem generalizes the well known adwords problem, and is also relevant for various other modern applications. A simple greedy algorithm is shown to be 3-competitive, whenever the weight of any edge is at most half of the corresponding server capacity. Moreover, a randomized version of the greedy algorithm is shown to be 6-competitive for the unrestricted edge weights case. For parallel servers with small-weight jobs, we show that a load-balancing algorithm is near-optimal.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Jalal, A., Vaze, R., & Bhaskar, U. (2015). Online Budgeted Repeated Matching. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1512.00153

MLA 9

Jalal, Ajil, et al. “Online Budgeted Repeated Matching.” arXiv (Cornell University), 2015. https://doi.org/10.48550/arxiv.1512.00153.

Chicago

Jalal, Ajil, Rahul Vaze, and Umang Bhaskar. 2015. “Online Budgeted Repeated Matching.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1512.00153.

Harvard

Jalal, A., Vaze, R. and Bhaskar, U. (2015) ‘Online Budgeted Repeated Matching’, arXiv (Cornell University). doi:10.48550/arxiv.1512.00153.

IEEE

A. Jalal, R. Vaze, and U. Bhaskar, “Online Budgeted Repeated Matching,” arXiv (Cornell University), 2015, doi: 10.48550/arxiv.1512.00153.

BibTeX

@misc{jalal2015online,
  title     = {{Online Budgeted Repeated Matching}},
  author    = {Jalal, Ajil and Vaze, Rahul and Bhaskar, Umang},
  howpublished = {arXiv (Cornell University)},
  year      = {2015},
  doi       = {10.48550/arxiv.1512.00153},
  url       = {https://doi.org/10.48550/arxiv.1512.00153}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems

  • online matching
  • greedy algorithm
  • competitive analysis
  • randomized algorithms
  • load balancing

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Jalal, A., Vaze, R., & Bhaskar, U. (2015). Online Budgeted Repeated Matching. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1512.00153

How many times has this paper been cited?

0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Ajil Jalal, Rahul Vaze, Umang Bhaskar.

What is the DOI of this paper?

10.48550/arxiv.1512.00153, permanently at https://doi.org/10.48550/arxiv.1512.00153. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.