1![Prior-Free Multi-Unit Auctions with Ordered Bidders∗ Sayan Bhattacharya† Elias Koutsoupias‡ Janardhan Kulkarni§ Prior-Free Multi-Unit Auctions with Ordered Bidders∗ Sayan Bhattacharya† Elias Koutsoupias‡ Janardhan Kulkarni§](https://www.pdfsearch.io/img/7b1639e28e00f56b705f814c377a1c73.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-05-17 21:55:22
|
---|
2![CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29, CS364B: Frontiers in Mechanism Design Lecture #8: MIR and MIDR Mechanisms∗ Tim Roughgarden† January 29,](https://www.pdfsearch.io/img/1d89bd9c3565885565f9c8b2fa83d8de.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-02-19 21:14:11
|
---|
3![Minimizing Regret with Multiple Reserves TIM ROUGHGARDEN, Stanford University JOSHUA R. WANG, Stanford University We study the problem of computing and learning non-anonymous reserve prices to maximize revenue. We first Minimizing Regret with Multiple Reserves TIM ROUGHGARDEN, Stanford University JOSHUA R. WANG, Stanford University We study the problem of computing and learning non-anonymous reserve prices to maximize revenue. We first](https://www.pdfsearch.io/img/f415a09c03d587c0e9927d7d65570656.jpg) | Add to Reading ListSource URL: web.stanford.eduLanguage: English - Date: 2016-08-08 16:20:04
|
---|
4![CS369N: Beyond Worst-Case Analysis Lecture #9: From Average-Case Analysis to Instance Optimality∗ Tim Roughgarden† December 4, 2009 CS369N: Beyond Worst-Case Analysis Lecture #9: From Average-Case Analysis to Instance Optimality∗ Tim Roughgarden† December 4, 2009](https://www.pdfsearch.io/img/a6e52ab894673a54d3219966bab63e0e.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2011-11-11 18:36:42
|
---|
5![Prior-Free Auctions with Ordered Bidders Stefano Leonardi∗ Sapienza University of Rome Via Ariosto, Rome, Italy Prior-Free Auctions with Ordered Bidders Stefano Leonardi∗ Sapienza University of Rome Via Ariosto, Rome, Italy](https://www.pdfsearch.io/img/8027d9a35b0c90a769b01be4f7d1b394.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2012-04-26 10:12:13
|
---|
6![CS364A: Algorithmic Game Theory Lecture #6: Simple Near-Optimal Auctions∗ Tim Roughgarden† October 9, CS364A: Algorithmic Game Theory Lecture #6: Simple Near-Optimal Auctions∗ Tim Roughgarden† October 9,](https://www.pdfsearch.io/img/822911a20c2f93664f34c65d14454ed1.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2015-09-22 16:30:12
|
---|
7![Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned TIM ROUGHGARDEN Stanford University This survey describes the approximately optimal mechanism design paradigm and uses it to investigate Approximately Optimal Mechanism Design: Motivation, Examples, and Lessons Learned TIM ROUGHGARDEN Stanford University This survey describes the approximately optimal mechanism design paradigm and uses it to investigate](https://www.pdfsearch.io/img/49f955dcde45e15c2e471285980fe9c2.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2014-11-26 15:35:14
|
---|
8![A Dip in the Reservoir: Maintaining Sample Synopses of Evolving Datasets Rainer Gemulla Wolfgang Lehner A Dip in the Reservoir: Maintaining Sample Synopses of Evolving Datasets Rainer Gemulla Wolfgang Lehner](https://www.pdfsearch.io/img/c41e4f7cf1f9a9cf29722df347c341d7.jpg) | Add to Reading ListSource URL: dws.informatik.uni-mannheim.deLanguage: English - Date: 2014-09-29 11:40:17
|
---|