Online Combinatorial Auctions
Online Combinatorial Auctions is a combinatorial auction framework in which bidders arrive sequentially over time and submit bids on bundles of items without full knowledge of future bids, distinguishing it from static combinatorial auctions by its incremental decision-making under uncertainty.
59
Publications
2.8K
Citations
152
Authors
78
Institutions
Publications per year
2017–2026
12
Variants
Dynamic Combinatorial Auctions
Parents
59
1–5 of 59
152
3
h-index
3
h-index
Hong Kong Polytechnic University, Hong Kong SAR China
3 publications · 287 citations
3
h-index
3
h-index
3
h-index
1–5 of 152
78

University of Hong Kong
Pok Fu Lam, Hong Kong
6 h-index
15 publications
941 citations
Stanford University
Stanford, United States
5 h-index
7 publications
129 citations
George Mason University
Fairfax, United States
3 h-index
3 publications
140 citations

University of Calgary
Calgary, Canada
3 h-index
6 publications
574 citations
Microsoft (United States)
Redmond, United States
3 h-index
6 publications
88 citations
Northwestern University
Evanston, United States
3 h-index
3 publications
73 citations
University of Maryland, College Park
College Park, United States
3 h-index
7 publications
517 citations
Yahoo (United States)
Sunnyvale, United States
3 h-index
9 publications
247 citations
1–8 of 78
2 publications · 270 citations
2
h-index
2 publications · 126 citations
2
h-index
2 publications · 213 citations
2
h-index
TON · 2 publications · 115 citations
2
h-index
2 publications · 64 citations
2
h-index
1–5