Multi-unit Combinatorial Auctions
Multi-Unit Combinatorial Auctions is a type of combinatorial auction in which multiple identical units of each good are available and bidders can express preferences over bundles of goods with quantities, distinguishing it from standard combinatorial auctions by allowing for both combinatorial bidding and multi-unit allocations.
53
Publications
2.4K
Citations
93
Authors
57
Institutions
Publications per year
2017–2026
7
Parents
53
Truthful and Near-Optimal Mechanism Design via Linear Programming
Ron Lavi, Chaitanya Swamy · 2005 · 225 citations
Incentive compatible multi unit combinatorial auctions
Yair Bartal, Rica Gonen, Noam Nisan · 2003 · 196 citations
Business, Economics, Mathematics +13
Optimal solutions for multi-unit combinatorial auctions
Rica Gonen, Daniel Lehmann · 2000 · 150 citations
An Algorithm for Multi-Unit Combinatorial Auctions
Kevin Leyton‐Brown, Yoav Shoham, Moshe Tennenholtz · 2000 · 138 citations
1–5 of 53
93
6
h-index
Artificial Intelligence Research Institute, Spain
6 publications · 156 citations
6
h-index
5
h-index
5
h-index
4
h-index
1–5 of 93
57
Artificial Intelligence Research Institute
Cerdanyola del Vallès, Spain
5 h-index
11 publications
281 citations
Universitat de Barcelona
Barcelona, Spain
5 h-index
5 publications
143 citations

University of Amsterdam
Amsterdam, The Netherlands
4 h-index
5 publications
124 citations
Hebrew University of Jerusalem
Jerusalem, Israel
3 h-index
8 publications
933 citations

University of Liverpool
Liverpool, United Kingdom
3 h-index
3 publications
55 citations

Zhejiang University
Hangzhou, China
2 h-index
4 publications
72 citations

University of Toronto
Toronto, Canada
2 h-index
4 publications
264 citations

Shizuoka University
Shizuoka, Japan
2 h-index
2 publications
24 citations
1–8 of 57
Repository · 3 publications · 83 citations
3
h-index
2 publications · 52 citations
2
h-index
2 publications · 61 citations
2
h-index
2 publications · 41 citations
2
h-index
1 publications · 41 citations
1
h-index
1–5