| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Improved Sample Complexity Bounds for Branch-And-Cut | Balcan, Maria-Florina et al. | 2022 |
| 2 | Electronic Market Design (Dagstuhl Seminar 02241) | Lehmann, Daniel et al. | 2021 |
| 3 | 07431 Abstracts Collection -- Computational Issues in Social Choice | Endriss, Ulle et al. | 2007 |
| 4 | 07431 Executive Summary -- Computational Issues in Social Choice | Endriss, Ulle et al. | 2007 |
| 5 | 05011 Abstracts Collection -- Computing and Markets | Lehmann, Daniel et al. | 2005 |
| 6 | 05011 Executive Summary -- Computing and Markets | Lehmann, Daniel et al. | 2005 |
| 7 | Automated Mechanism Design | Sandholm, Tuomas | 2005 |
| 8 | Sequences of Take-It-or-Leave-It Offers: Near-Optimal Auctions Without Full Valuation Revelation | Sandholm, Tuomas et al. | 2005 |
| 9 | Spiteful Bidding in Sealed-Bid Auctions | Brandt, Felix et al. | 2005 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |