ผลต่างระหว่างรุ่นของ "Cost sharing reading list"
ไปยังการนำทาง
ไปยังการค้นหา
(→Papers) |
|||
| (ไม่แสดง 3 รุ่นระหว่างกลางโดยผู้ใช้ 2 คน) | |||
| แถว 1: | แถว 1: | ||
==Papers== | ==Papers== | ||
| − | * [http://www.cs.berkeley.edu/~christos/multicast.ps Sharing the Cost of Multicast Transmissions] by Feigenbaum, Papadimitriou, Shenker | + | * [http://www.cs.berkeley.edu/~christos/multicast.ps Sharing the Cost of Multicast Transmissions] by Feigenbaum, Papadimitriou, Shenker in STOC 2000. |
| + | * [http://theory.stanford.edu/~tim/papers/trade.pdf New Trade-Offs in Cost-Sharing Mechanisms] (STOC '06) by Tim Roughgarden and Mukund Sundararajan. | ||
| + | * [http://www.springerlink.com/content/kqug43uxa6gtge1w/?p=f00f07b6c2294926a83d15b080ee01a5&pi=0 Strategyproof sharing of submodular costs:budget balance versus efficiency] The classics by Moulin and Shenker (appeared in Economic Theory) | ||
| + | * [http://cs-www.cs.yale.edu/homes/jf/FKSS2.pdf A collection of hardness results for Distributed Mechanisms] | ||
==Course webpages== | ==Course webpages== | ||
รุ่นแก้ไขปัจจุบันเมื่อ 08:42, 2 กุมภาพันธ์ 2550
Papers
- Sharing the Cost of Multicast Transmissions by Feigenbaum, Papadimitriou, Shenker in STOC 2000.
- New Trade-Offs in Cost-Sharing Mechanisms (STOC '06) by Tim Roughgarden and Mukund Sundararajan.
- Strategyproof sharing of submodular costs:budget balance versus efficiency The classics by Moulin and Shenker (appeared in Economic Theory)
- A collection of hardness results for Distributed Mechanisms
Course webpages
- Algorithmic Game Theory at Cornell
- Introduction to Algorithmic Game Theory at Stanford
- Algorithmic Game Theory at McGill
- Algorithmic Game Theory at ETH
- Seminar on Algorithmic Aspects of Game Theory at Berkeley (very old)
