Auction Algorithms

Auction Algorithms is a class of iterative optimization methods belonging to the broader category of combinatorial algorithms, distinguished by its simulation of competitive bidding processes to solve assignment problems by maximizing dual objective functions through primal-dual updates.

1.2K

Publications

67.1K

Citations

2.5K

Authors

834

Institutions

Publications per year

2017–2026

284

Authors

2.5K

  1. TS
    Tüomas Sandholm

    Carnegie Mellon University, United States

    30 publications · 3.4K citations

    24

    h-index

  2. ZL
    Zongpeng Li

    University of Calgary, Canada

    20 publications · 931 citations

    17

    h-index

  3. CW
    Chuan Wu

    University of Hong Kong, Hong Kong SAR China

    16 publications · 811 citations

    14

    h-index

  4. DP
    Dimitri P. Bertsekas

    Massachusetts Institute of Technology, United States

    14 publications · 2.4K citations

    14

    h-index

  5. NN
    Noam Nisan

    Hebrew University of Jerusalem, Israel

    15 publications · 2.1K citations

    14

    h-index

1–5 of 2.5K

Venues

  1. IEEE Transactions on Mobile Computing

    TMCCI · 22 publications · 1.7K citations

    20

    h-index

  2. Management Science

    17 publications · 2.5K citations

    15

    h-index

  3. IEEE Transactions on Power Systems

    17 publications · 1K citations

    15

    h-index

  4. IEEE Internet of Things Journal

    15 publications · 609 citations

    15

    h-index

  5. arXiv (Cornell University)

    Repository · 16 publications · 423 citations

    14

    h-index

1–5