Winner Determination Problem
The Winner Determination Problem is a computational optimization problem in combinatorial auctions that consists in determining the allocation of items to bidders that maximizes the auctioneer's revenue under the constraint that each item is allocated to at most one bidder, given a set of bids specifying subsets of items and associated prices.
439
Publications
25.4K
Citations
1K
Authors
481
Institutions
Publications per year
2017–2026
101
Variants
Wdp
Parents
439
Algorithm for optimal winner determination in combinatorial auctions
Tüomas Sandholm · Artificial Intelligence · 2002 · 925 citations
Business, Mathematics, Algorithms +13
Kybernetes · 2008 · 587 citations
Condorcet Social Choice Functions
Peter C. Fishburn · SIAM Journal on Applied Mathematics · 1977 · 564 citations
Bidding and allocation in combinatorial auctions
Noam Nisan · 2000 · 527 citations
Business, Economics, Mathematics +12
1–5 of 439
1K
15
h-index
13
h-index
10
h-index
8
h-index
7
h-index
1–5 of 1K
481
Carnegie Mellon University
Pittsburgh, United States
13 h-index
17 publications
2.3K citations
National University of Singapore
Singapore, Singapore
12 h-index
18 publications
637 citations
University of Oxford
Oxford, United Kingdom
12 h-index
15 publications
468 citations

Northeastern University
Shenyang, China
10 h-index
22 publications
806 citations
Technical University of Munich
Munich, Germany
10 h-index
23 publications
1.2K citations
AGH University of Krakow
Krakow, Poland
10 h-index
10 publications
608 citations

Pennsylvania State University
State College, United States
10 h-index
15 publications
845 citations

University of Toronto
Toronto, Canada
9 h-index
14 publications
994 citations
1–8 of 481
Conference · 12 publications · 361 citations
11
h-index
10 publications · 554 citations
10
h-index
Repository · 9 publications · 144 citations
9
h-index
JAIR · 8 publications · 680 citations
8
h-index
8 publications · 488 citations
8
h-index
1–5