Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

Algorithmic Game Theory, Gairing


Варианты приобретения
Цена: 8106.00р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Америка: Есть  
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину
в Мои желания

Автор: Gairing
Название:  Algorithmic Game Theory
ISBN: 9783662533536
Издательство: Springer
Классификация:





ISBN-10: 3662533537
Обложка/Формат: Paperback
Страницы: 347
Вес: 0.55 кг.
Дата издания: 2016
Серия: Information Systems and Applications, incl. Internet/Web, and HCI
Язык: English
Иллюстрации: 38 black & white illustrations, biography
Размер: 234 x 156 x 19
Читательская аудитория: Professional & vocational
Основная тема: Computer Science
Подзаголовок: 9th International Symposium, SAGT 2016, Liverpool, UK, September 19–21, 2016, Proceedings
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: This book constitutes the refereed proceedings of the 9th International Symposium on Algorithmic Game Theory, SAGT 2016, held in Liverpool, UK, in September 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.

Дополнительное описание: Computational Aspects of Games.- Congestion Games and Networks.- Matching and Voting.- Auctions and Markets.- Mechanism Design.- Abstracts



Algorithmic Game Theory

Автор: Marios Mavronicolas; Maria Papadoupoulou
Название: Algorithmic Game Theory
ISBN: 3642046444 ISBN-13(EAN): 9783642046445
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume contains the papers presented at the Second International Sym- sium on Algorithmic Game Theory (SAGT 2009), which was held on October 18-20, 2009, in Paphos, Cyprus. This event followed the ?rst, very successful SAGT symposium, which took place in Paderborn, Germany, last year. The purpose of SAGT is to bring together researchers from computer s- ence, economics and mathematics to present and discuss originalresearchat the intersection of algorithms and game theory. It has been intended to cover all important areas such as solution concepts, game classes, computation of equil- riaandmarketequilibria, algorithmicmechanismdesign, automatedmechanism design, convergenceandlearningingames, complexityclassesingametheory, - gorithmicaspectsof?xed-pointtheorems, mechanisms, incentivesandcoalitions, cost-sharing algorithms, computational problems in economics, ?nance, decision theory and pricing, computational social choice, auction algorithms, price of - archyand its relatives, representationsof games and their complexity, economic aspects of distributed computing and the internet, congestion, routing and n- work design and formation games and game-theoretic approaches to networking problems. Approximately55submissionstoSAGT2009 werereceived.Eachsubmission was reviewed by at least three Program Committee members. The Program Committee decided to accept 29 papers. Out of these, a small number will be invited to a Special Issue of the Theory of Computing Systems journal with selected papers from SAGT 2009. The program of SAGT 2009 featured three invited talks from three outstanding researchers in algorithmic game theory: Elias Koutsoupias, Dov Monderer and Mihalis Yannakakis. We are very grateful toElias, DovandMihalisforjoiningusinPaphosandfortheirexcellentlectures.

Algorithmic Game Theory

Автор: Edited by Noam Nisan
Название: Algorithmic Game Theory
ISBN: 0521872820 ISBN-13(EAN): 9780521872829
Издательство: Cambridge Academ
Рейтинг:
Цена: 9821.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on incentives and pricing, cost sharing, information markets and cryptography and security.

Twenty Lectures on Algorithmic Game Theory

Автор: Roughgarden
Название: Twenty Lectures on Algorithmic Game Theory
ISBN: 1107172667 ISBN-13(EAN): 9781107172661
Издательство: Cambridge Academ
Рейтинг:
Цена: 12197.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book gives students a quick and accessible introduction to many of the most important concepts in the field of algorithmic game theory. It demonstrates these concepts through case studies in online advertising, wireless spectrum auctions, kidney exchange, and network management.

Algorithmic Game Theory

Автор: Burkhard Monien; Ulf-Peter Schroeder
Название: Algorithmic Game Theory
ISBN: 3540793089 ISBN-13(EAN): 9783540793083
Издательство: Springer
Рейтинг:
Цена: 10480.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: First International Symposium SAGT 2008 Paderborn Germany April 30 - May 2 2008 Proceedings.

Algorithmic Learning Theory

Автор: Ricard Gavalda; Gabor Lugosi; Thomas Zeugmann; San
Название: Algorithmic Learning Theory
ISBN: 3642044131 ISBN-13(EAN): 9783642044137
Издательство: Springer
Рейтинг:
Цена: 12577.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The papers are divided into topical sections of papers on online learning, learning graphs, active learning and query learning, statistical learning, inductive inference, and semisupervised and unsupervised learning.

Algorithmic Puzzles

Автор: Levitin, Anany; Levitin, Maria
Название: Algorithmic Puzzles
ISBN: 0199740445 ISBN-13(EAN): 9780199740444
Издательство: Oxford Academ
Рейтинг:
Цена: 5384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Algorithmic puzzles are puzzles involving well-defined procedures for solving problems. This book will provide an enjoyable and accessible introduction to algorithmic puzzles that will develop the reader`s algorithmic thinking.

Algorithmic geometry

Автор: Boissonnat, Jean-daniel Yvinec, Mariette
Название: Algorithmic geometry
ISBN: 0521565294 ISBN-13(EAN): 9780521565295
Издательство: Cambridge Academ
Рейтинг:
Цена: 9346.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The goals of this book are twofold: first to present a coherent and systematic treatment of the foundations; secondly to present algorithmic solutions to problems that are simple to state but which nevertheless are applicable in practical situations. The prerequisites for using the book are few, which will make it ideal for teaching advanced courses in computational geometry.

Twenty Lectures on Algorithmic Game Theory

Автор: Roughgarden
Название: Twenty Lectures on Algorithmic Game Theory
ISBN: 131662479X ISBN-13(EAN): 9781316624791
Издательство: Cambridge Academ
Рейтинг:
Цена: 5702.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book gives students a quick and accessible introduction to many of the most important concepts in the field of algorithmic game theory. It demonstrates these concepts through case studies in online advertising, wireless spectrum auctions, kidney exchange, and network management.

Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory

Автор: Chaitin Gregory J
Название: Information, Randomness & Incompleteness: Papers On Algorithmic Information Theory
ISBN: 9971504790 ISBN-13(EAN): 9789971504793
Издательство: World Scientific Publishing
Рейтинг:
Цена: 19166.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The papers gathered in this book were published over a period of more than twenty years in widely scattered journals. They led to the discovery of randomness in arithmetic which was presented in the recently published monograph on "Algorithmic Information Theory" by the author. There the strongest possible version of G del's incompleteness theorem, using an information-theoretic approach based on the size of computer programs, was discussed. The present book is intended as a companion volume to the monograph and it will serve as a stimulus for work on complexity, randomness and unpredictability, in physics and biology as well as in metamathematics.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия