You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
A lively introduction to Game Theory, ideal for students in mathematics, computer science, or economics.
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.
Graduate textbook presenting abstract models of bargaining in a unified framework with detailed applications involving economic, political and social situations.
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...
The rapidly growing field of computational social choice, at the intersection of computer science and economics, deals with the computational aspects of collective decision making. This handbook, written by thirty-six prominent members of the computational social choice community, covers the field comprehensively. Chapters devoted to each of the field's major themes offer detailed introductions. Topics include voting theory (such as the computational complexity of winner determination and manipulation in elections), fair allocation (such as algorithms for dividing divisible and indivisible goods), coalition formation (such as matching and hedonic games), and many more. Graduate students, researchers, and professionals in computer science, economics, mathematics, political science, and philosophy will benefit from this accessible and self-contained book.
At its core, economics is about making decisions. In the history of economic thought, great intellectual prowess has been exerted toward devising exquisite theories of optimal decision making in situations of constraint, risk, and scarcity. Yet not all of our choices are purely logical, and so there is a longstanding tension between those emphasizing the rational and irrational sides of human behavior. One strand develops formal models of rational utility maximizing while the other draws on what behavioral science has shown about our tendency to act irrationally. In Risk, Choice, and Uncertainty, George G. Szpiro offers a new narrative of the three-century history of the study of decision ma...
This book constitutes the refereed proceedings of the First International Symposium on Algorithmic Game Theory, SAGT 2008, held in Paderborn, Germany, in April/May 2008. The 28 revised full papes presented together with 3 invited lectures were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections on routing and scheduling, markets, mechanism design, potpourri of games, solution concepts, and cost sharing.
This book constitutes the proceedings of the 15th International Symposium on Algorithmic Game Theory, SAGT 2022, which took place in Colchester, UK, in September 2022. The 31 full papers included in this book were carefully reviewed and selected from 83 submissions. They were organized in topical sections as follows: Auctions, markets and mechanism design; computational aspects in games; congestion and network creation games; data sharing and learning; social choice and stable matchings.
Combinatorial game theory is the study of two-player games with no hidden information and no chance elements. The theory assigns algebraic values to positions in such games and seeks to quantify the algebraic and combinatorial structure of their interactions. Its modern form was introduced thirty years ago, with the publication of the classic Winning Ways for Your Mathematical Plays by Berlekamp, Conway, and Guy, and interest has rapidly increased in recent decades. This book is a comprehensive and up-to-date introduction to the subject, tracing its development from first principles and examples through many of its most recent advances. Roughly half the book is devoted to a rigorous treatmen...
The biannual conferences bring together researchers from a wide variety of fields sharing a common interest in reasoning about rationality and knowledge. the impact of this tradition, going back to 1986, is apparent in many of today's research trends and in the growth of an intellectual community beyond traditional disciplinary boundaries. this volume documents the eleventh conference, held in Brussels, Belgium, in June 2007. it includes contributed papers, 3 invited talks. Like earlier volumes in this series, it gives a window of the state of the art in studies of knowledge and information flow in areas such as probability, linguistic semantics, logics for communication, belief revision, game theory, and interactions between these. should be of value for researchers, teachers, and students alike.