Twenty Lectures on Algorithmic Game Theory
Autor Tim Roughgardenen Limba Engleză Paperback – 30 aug 2016
Preț: 261.17 lei
Preț vechi: 326.46 lei
-20%
Puncte Express: 392
Carte tipărită la comandă
Livrare economică 25 mai-08 iunie
Specificații
ISBN-13: 9781316624791
ISBN-10: 131662479X
Pagini: 352
Dimensiuni: 150 x 226 x 20 mm
Greutate: 0.5 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
ISBN-10: 131662479X
Pagini: 352
Dimensiuni: 150 x 226 x 20 mm
Greutate: 0.5 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
Cuprins
1. Introduction and examples; 2. Mechanism design basics; 3. Myerson's Lemma; 4. Algorithmic mechanism design 34; 5. Revenue-maximizing auctions; 6. Simple near-optimal auctions; 7. Multi-parameter mechanism design; 8. Spectrum auctions; 9. Mechanism design with payment constraints; 10. Kidney exchange and stable matching; 11. Selfish routing and the price of anarchy; 12. Network over-provisioning and atomic selfish routing; 13. Equilibria: definitions, examples, and existence; 14. Robust price-of-anarchy bounds in smooth games; 15. Best-case and strong Nash equilibria; 16. Best-response dynamics; 17. No-regret dynamics; 18. Swap regret and the Minimax theorem; 19. Pure Nash equilibria and PLS-completeness; 20. Mixed Nash equilibria and PPAD-completeness.
Recenzii
'There are several features of this book that make it very well suited both for the classroom and for self-study … if your interest is in understanding how game theory, economics and computer science are cross-pollinating to address challenges of the design of online strategic interactions, this is the book to start with. It is clear, well-organized and makes a compelling introduction to a vibrant field.' David Burke, MAA Reviews
Descriere
This accessible introduction features case studies in online advertising, spectrum auctions, kidney exchange, and network management.