Online Assignment Problem
The "Online Assignment Problem" is an assignment problem in which tasks or agents arrive sequentially over time and must be assigned in real-time without prior knowledge of future arrivals, distinguishing it from classical assignment problems by its incremental and irrevocable decision-making nature.
94
Publications
5.1K
Citations
287
Authors
140
Institutions
Publications per year
2017–2026
43
Parents
94
New Ressults on Server Problems
Marek Chrobák, H. Karloof, Tom Payne et al. · SIAM Journal on Discrete Mathematics · 1991 · 211 citations
1–5 of 94
287
Hong Kong University of Science and Technology, Hong Kong SAR China
7 publications · 439 citations
7
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 287
140

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
8 h-index
12 publications
787 citations
University of Maryland, College Park
College Park, United States
6 h-index
15 publications
393 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
5 h-index
9 publications
666 citations

Beihang University
Beijing, China
4 h-index
12 publications
1.3K citations
Tsinghua University
Beijing, China
4 h-index
11 publications
665 citations
University of Michigan
Ann Arbor, United States
3 h-index
5 publications
229 citations
Purdue University West Lafayette
West Lafayette, United States
3 h-index
7 publications
339 citations
Google (United States)
Mountain View, United States
3 h-index
6 publications
436 citations
1–8 of 140
3 publications · 310 citations
3
h-index
Conference · 2 publications · 392 citations
2
h-index
TRR · 2 publications · 54 citations
2
h-index
2 publications · 176 citations
2
h-index
2 publications · 83 citations
2
h-index
1–5