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
Parents
1.2K
A Theory of Auctions and Competitive Bidding
Paul Milgrom, Robert J. Weber · Econometrica · 1982 · 3.8K citations
Combinatorial Auctions: A Survey
Sven de Vries, Rakesh Vohra · INFORMS journal on computing · 2003 · 997 citations
Business, Economics, Mathematics +16
1–5 of 1.2K
2.5K
24
h-index
17
h-index
14
h-index
Massachusetts Institute of Technology, United States
14 publications · 2.4K citations
14
h-index
14
h-index
1–5 of 2.5K
834
Carnegie Mellon University
Pittsburgh, United States
30 h-index
68 publications
5K citations
Massachusetts Institute of Technology
Cambridge, United States
24 h-index
47 publications
6.3K citations

University of Hong Kong
Pok Fu Lam, Hong Kong
22 h-index
61 publications
2.8K citations
Stanford University
Stanford, United States
22 h-index
60 publications
4.3K citations
Hebrew University of Jerusalem
Jerusalem, Israel
20 h-index
40 publications
4.9K citations

University of Calgary
Calgary, Canada
18 h-index
33 publications
1.8K citations

Shanghai Jiao Tong University
Shanghai, China
18 h-index
85 publications
4.6K citations
University of Maryland, College Park
College Park, United States
16 h-index
33 publications
1.5K citations
1–8 of 834
TMCCI · 22 publications · 1.7K citations
20
h-index
17 publications · 2.5K citations
15
h-index
17 publications · 1K citations
15
h-index
15 publications · 609 citations
15
h-index
Repository · 16 publications · 423 citations
14
h-index
1–5