Twenty Lectures on Algorithmic Game Theory

Twenty Lectures on Algorithmic Game Theory PDF Author: Tim Roughgarden
Publisher: Cambridge University Press
ISBN: 1316782093
Category : Computers
Languages : en
Pages : 357

Get Book Here

Book Description
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

Twenty Lectures on Algorithmic Game Theory

Twenty Lectures on Algorithmic Game Theory PDF Author: Tim Roughgarden
Publisher: Cambridge University Press
ISBN: 1316781178
Category : Computers
Languages : en
Pages : 356

Get Book Here

Book Description
Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

Algorithmic Game Theory

Algorithmic Game Theory PDF Author: Ioannis Caragiannis
Publisher: Springer Nature
ISBN: 3030859479
Category : Computers
Languages : en
Pages : 424

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithmic Game Theory, SAGT 2021, held in Aarhus, Denmark in September 2021. The 26 full papers presented together with 4 abstract papers were carefully reviewed and selected from 73 submissions. In addition, the volume contains abstracts from 3 invited talks and 2 tutorial talks. The papers are organized in topical sections named: auctions and mechanism design, computational aspects of games, markets and matchings, and social choice and cooperative games.

Selfish Routing and the Price of Anarchy

Selfish Routing and the Price of Anarchy PDF Author: Tim Roughgarden
Publisher: MIT Press
ISBN: 9780262264358
Category : Computers
Languages : en
Pages : 216

Get Book Here

Book Description
An analysis of the loss in performance caused by selfish, uncoordinated behavior in networks. Most of us prefer to commute by the shortest route available, without taking into account the traffic congestion that we cause for others. Many networks, including computer networks, suffer from some type of this "selfish routing." In Selfish Routing and the Price of Anarchy, Tim Roughgarden studies the loss of social welfare caused by selfish, uncoordinated behavior in networks. He quantifies the price of anarchy—the worst-possible loss of social welfare from selfish routing—and also discusses several methods for improving the price of anarchy with centralized control. Roughgarden begins with a relatively nontechnical introduction to selfish routing, describing two important examples that motivate the problems that follow. The first, Pigou's Example, demonstrates that selfish behavior need not generate a socially optimal outcome. The second, the counterintiuitve Braess's Paradox, shows that network improvements can degrade network performance. He then develops techniques for quantifying the price of anarchy (with Pigou's Example playing a central role). Next, he analyzes Braess's Paradox and the computational complexity of detecting it algorithmically, and he describes Stackelberg routing, which improves the price of anarchy using a modest degree of central control. Finally, he defines several open problems that may inspire further research. Roughgarden's work will be of interest not only to researchers and graduate students in theoretical computer science and optimization but also to other computer scientists, as well as to economists, electrical engineers, and mathematicians.

Algorithmic Game Theory

Algorithmic Game Theory PDF Author: Noam Nisan
Publisher: Cambridge University Press
ISBN: 9780521872829
Category : Computers
Languages : en
Pages : 778

Get Book Here

Book Description
In the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues. 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. Students, researchers and practitioners alike need to learn more about these fascinating theoretical developments and their widespread practical application.

Algorithmic Game Theory

Algorithmic Game Theory PDF Author: Tobias Harks
Publisher: Springer Nature
ISBN: 3030579808
Category : Computers
Languages : en
Pages : 346

Get Book Here

Book Description
This book constitutes the refereed proceedings of the 13th International Symposium on Algorithmic Game Theory, SAGT 2020, held in Augsburg, Germany, in September 2020.* The 21 full papers presented together with 3 abstract papers were carefully reviewed and selected from 53 submissions. The papers are organized in topical sections named: auctions and mechanism design, congestion games and flows over time, markets and matchings, scheduling and games on graphs, and social choice and cooperative games. * The conference was held virtually due to the COVID-19 pandemic.

Economics and Computation

Economics and Computation PDF Author: Jörg Rothe
Publisher: Springer Nature
ISBN: 3031600991
Category : Econometrics
Languages : en
Pages : 779

Get Book Here

Book Description
This textbook connects three vibrant areas at the interface between economics and computer science: algorithmic game theory, computational social choice, and fair division. It thus offers an interdisciplinary treatment of collective decision making from an economic and computational perspective. Part I introduces to algorithmic game theory, focusing on both noncooperative and cooperative game theory. Part II introduces to computational social choice, focusing on both preference aggregation (voting) and judgment aggregation. Part III introduces to fair division, focusing on the division of both a single divisible resource ("cake-cutting") and multiple indivisible and unshareable resources ("multiagent resource allocation"). In all these parts, much weight is given to the algorithmic and complexity-theoretic aspects of problems arising in these areas, and the interconnections between the three parts are of central interest.

Game Theory, Alive

Game Theory, Alive PDF Author: Anna R. Karlin
Publisher: American Mathematical Soc.
ISBN: 1470419823
Category : Mathematics
Languages : en
Pages : 400

Get Book Here

Book Description
We live in a highly connected world with multiple self-interested agents interacting and myriad opportunities for conflict and cooperation. The goal of game theory is to understand these opportunities. This book presents a rigorous introduction to the mathematics of game theory without losing sight of the joy of the subject. This is done by focusing on theoretical highlights (e.g., at least six Nobel Prize winning results are developed from scratch) and by presenting exciting connections of game theory to other fields such as computer science (algorithmic game theory), economics (auctions and matching markets), social choice (voting theory), biology (signaling and evolutionary stability), and learning theory. Both classical topics, such as zero-sum games, and modern topics, such as sponsored search auctions, are covered. Along the way, beautiful mathematical tools used in game theory are introduced, including convexity, fixed-point theorems, and probabilistic arguments. The book is appropriate for a first course in game theory at either the undergraduate or graduate level, whether in mathematics, economics, computer science, or statistics. The importance of game-theoretic thinking transcends the academic setting—for every action we take, we must consider not only its direct effects, but also how it influences the incentives of others.

Lectures in Game Theory for Computer Scientists

Lectures in Game Theory for Computer Scientists PDF Author: Krzysztof R. Apt
Publisher: Cambridge University Press
ISBN: 113949418X
Category : Computers
Languages : en
Pages : 308

Get Book Here

Book Description
Games provide mathematical models for interaction. Numerous tasks in computer science can be formulated in game-theoretic terms. This fresh and intuitive way of thinking through complex issues reveals underlying algorithmic questions and clarifies the relationships between different domains. This collection of lectures, by specialists in the field, provides an excellent introduction to various aspects of game theory relevant for applications in computer science that concern program design, synthesis, verification, testing and design of multi-agent or distributed systems. Originally devised for a Spring School organised by the GAMES Networking Programme in 2009, these lectures have since been revised and expanded, and range from tutorials concerning fundamental notions and methods to more advanced presentations of current research topics. This volume is a valuable guide to current research on game-based methods in computer science for undergraduate and graduate students. It will also interest researchers working in mathematical logic, computer science and game theory.

The Ethical Algorithm

The Ethical Algorithm PDF Author: Michael Kearns
Publisher:
ISBN: 0190948205
Category : Business & Economics
Languages : en
Pages : 229

Get Book Here

Book Description
Algorithms have made our lives more efficient and entertaining--but not without a significant cost. Can we design a better future, one in which societial gains brought about by technology are balanced with the rights of citizens? The Ethical Algorithm offers a set of principled solutions based on the emerging and exciting science of socially aware algorithm design.

Multiagent Systems

Multiagent Systems PDF Author: Yoav Shoham
Publisher: Cambridge University Press
ISBN: 9780521899437
Category : Computers
Languages : en
Pages : 504

Get Book Here

Book Description
This exciting and pioneering new overview of multiagent systems, which are online systems composed of multiple interacting intelligent agents, i.e., online trading, offers a newly seen computer science perspective on multiagent systems, while integrating ideas from operations research, game theory, economics, logic, and even philosophy and linguistics. The authors emphasize foundations to create a broad and rigorous treatment of their subject, with thorough presentations of distributed problem solving, game theory, multiagent communication and learning, social choice, mechanism design, auctions, cooperative game theory, and modal logics of knowledge and belief. For each topic, basic concepts are introduced, examples are given, proofs of key results are offered, and algorithmic considerations are examined. An appendix covers background material in probability theory, classical logic, Markov decision processes and mathematical programming. Written by two of the leading researchers of this engaging field, this book will surely serve as THE reference for researchers in the fastest-growing area of computer science, and be used as a text for advanced undergraduate or graduate courses.