Theoretical guarantees for algorithms in multi-agent settings (2004)
by
Martin Zinkevich
| Citations: | 4 - 1 self |
BibTeX
@TECHREPORT{Zinkevich04theoreticalguarantees,
author = {Martin Zinkevich},
title = {Theoretical guarantees for algorithms in multi-agent settings},
institution = {},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This material is based upon work supported under NSF grants CCR-9732705, CCR-0085982, CAREER Award IRI-9703122,
Citations
| 459 | Algorithm for optimal winner determination in combinatorial auctions - SANDHOLM |
| 213 | The michigan internet AuctionBot: a configurable auction server for human and software agents - Wurman, Wellman, et al. - 1998 |
| 140 | Winner determination in combinatorial auction generalizations - Sandholm, Suri, et al. - 2002 |
| 125 | Online convex programming and generalized infinitesimal gradient ascent - Zinkevich |
| 118 | Cabob: a fast optimal algorithm for combinatorial auctions - Sandholm, Suri, et al. - 2001 |
| 66 | AkBA: A progressive, anonymous-price combinatorial auction - Wurman, Wellman - 2000 |
| 38 | Market clearability - Sandholm, Suri |
| 31 | On polynomialtime preference elicitation with value queries - Zinkevich, Blum, et al. - 2003 |
| 28 | Incentive Efficiency of Double Auctions - Wilson - 1985 |
| 15 | Optimal clearing of supply/demand curves - Sandholm, Suri - 2002 |
| 2 | Game-Theoretic Approaches to TradingProcesses - Wilson - 1987 |
