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

Authors

1K

  1. TS
    Tüomas Sandholm

    Carnegie Mellon University, United States

    15 publications · 2.7K citations

    15

    h-index

  2. PF
    Piotr Faliszewski

    AGH University of Krakow, Poland

    14 publications · 843 citations

    13

    h-index

  3. JR
    Jörg Rothe

    Heinrich Heine University Düsseldorf, Germany

    10 publications · 921 citations

    10

    h-index

  4. PS
    Piotr Skowron

    University of Warsaw, Poland

    8 publications · 306 citations

    8

    h-index

  5. JL
    Jérôme Lang

    Université Toulouse III - Paul Sabatier, France

    7 publications · 331 citations

    7

    h-index

1–5 of 1K

Venues

  1. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 12 publications · 361 citations

    11

    h-index

  2. European Journal of Operational Research

    10 publications · 554 citations

    10

    h-index

  3. arXiv (Cornell University)

    Repository · 9 publications · 144 citations

    9

    h-index

  4. Journal of Artificial Intelligence Research

    JAIR · 8 publications · 680 citations

    8

    h-index

  5. Games and Economic Behavior

    8 publications · 488 citations

    8

    h-index

1–5