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

Authors

287

  1. LC
    Lei Chen

    Hong Kong University of Science and Technology, Hong Kong SAR China

    7 publications · 439 citations

    7

    h-index

  2. HS
    Hani S. Mahmassani

    Northwestern University, United States

    4 publications · 260 citations

    4

    h-index

  3. YT
    Yongxin Tong

    Beihang University, China

    4 publications · 430 citations

    4

    h-index

  4. LW
    Libin Wang

    Chinese Academy of Sciences, China

    3 publications · 339 citations

    3

    h-index

  5. PX
    Pan Xu

    University of Maryland, College Park, United States

    3 publications · 134 citations

    3

    h-index

1–5 of 287

Venues

  1. 3

    h-index

  2. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 2 publications · 392 citations

    2

    h-index

  3. 2

    h-index

  4. IEEE Transactions on Vehicular Technology

    2 publications · 176 citations

    2

    h-index

  5. 2

    h-index

1–5