Algorithmic Game Theory
Editat de Martin Gairing, Rahul Savanien Limba Engleză Paperback – sep 2016
The 26 full papers presented together with 2 one-page abstracts were carefully reviewed and selected from 62 submissions.
The accepted submissions cover various important aspects
of algorithmic game theory such as computational aspects of games, congestion games and networks, matching and voting, auctions and markets, and mechanism design.
Preț: 325.25 lei
Preț vechi: 406.56 lei
-20%
Puncte Express: 488
Preț estimativ în valută:
57.51€ • 65.95$ • 49.71£
57.51€ • 65.95$ • 49.71£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783662533536
ISBN-10: 3662533537
Pagini: 360
Ilustrații: XI, 347 p. 38 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:1st edition 2016
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662533537
Pagini: 360
Ilustrații: XI, 347 p. 38 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:1st edition 2016
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Cuprins
Computational Aspects of Games.- Congestion Games and Networks.- Matching and Voting.- Auctions and Markets.- Mechanism Design.- Abstracts
Caracteristici
Includes supplementary material: sn.pub/extras