Author: Georgios Chalkiadakis
Publisher: Morgan & Claypool Publishers
ISBN: 1608456528
Category : Computers
Languages : en
Pages : 171
Get Book Here
Book Description
Cooperative game theory is a branch of (micro-)economics that studies the behavior of self-interested agents in strategic settings where binding agreements among agents are possible. Our aim in this book is to present a survey of work on the computational aspects of cooperative game theory. We begin by formally defining transferable utility games in characteristic function form, and introducing key solution concepts such as the core and the Shapley value. We then discuss two major issues that arise when considering such games from a computational perspective: identifying compact representations for games, and the closely related problem of efficiently computing solution concepts for games. We survey several formalisms for cooperative games that have been proposed in the literature, including, for example, cooperative games defined on networks, as well as general compact representation schemes such as MC-nets and skill games. As a detailed case study, we consider weighted voting games: a widely-used and practically important class of cooperative games that inherently have a natural compact representation. We investigate the complexity of solution concepts for such games, and generalizations of them. We briefly discuss games with non-transferable utility and partition function games. We then overview algorithms for identifying welfare-maximizing coalition structures and methods used by rational agents to form coalitions (even under uncertainty), including bargaining algorithms. We conclude by considering some developing topics, applications, and future research directions.
Author: Georgios Raedt
Publisher: Springer Nature
ISBN: 3031015584
Category : Computers
Languages : en
Pages : 150
Get Book Here
Book Description
Cooperative game theory is a branch of (micro-)economics that studies the behavior of self-interested agents in strategic settings where binding agreements among agents are possible. Our aim in this book is to present a survey of work on the computational aspects of cooperative game theory. We begin by formally defining transferable utility games in characteristic function form, and introducing key solution concepts such as the core and the Shapley value. We then discuss two major issues that arise when considering such games from a computational perspective: identifying compact representations for games, and the closely related problem of efficiently computing solution concepts for games. We survey several formalisms for cooperative games that have been proposed in the literature, including, for example, cooperative games defined on networks, as well as general compact representation schemes such as MC-nets and skill games. As a detailed case study, we consider weighted voting games: a widely-used and practically important class of cooperative games that inherently have a natural compact representation. We investigate the complexity of solution concepts for such games, and generalizations of them. We briefly discuss games with non-transferable utility and partition function games. We then overview algorithms for identifying welfare-maximizing coalition structures and methods used by rational agents to form coalitions (even under uncertainty), including bargaining algorithms. We conclude by considering some developing topics, applications, and future research directions.
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.
Author: A. J. Jones
Publisher: Horwood Publishing
ISBN: 9781898563143
Category : Mathematics
Languages : en
Pages : 304
Get Book Here
Book Description
This modern, still relevant text is suitable for senior undergraduate and graduate students, teachers and professionals in mathematics, operational research, economics, sociology; and psychology, defence and strategic studies, and war games. Engagingly written with agreeable humor, the book can also be understood by non-mathematicians. It shows basic ideas of extensive form, pure and mixed strategies, the minimax theorem, non-cooperative and co-operative games, and a ''first class'' account of linear programming, theory and practice. The text is self-contained with comprehensive source references. Based on a series of lectures given by the author in the theory of games at Royal Holloway College, it gives unusually comprehensive but concise treatment of co-operative games, an original account of bargaining models, with a skilfully guided tour through the Shapely and Nash solutions for bimatrix games and a carefully illustrated account of finding the best threat strategies.
Author: Francisco Javier Muros
Publisher: Springer
ISBN: 3030104893
Category : Technology & Engineering
Languages : en
Pages : 233
Get Book Here
Book Description
This book analyzes coalitional control schemes by incorporating concepts of cooperative game theory into a distributed control framework. It considers a networked architecture where the nodes are the agents and the edges are their communication links and either the agents or the links are established as the players of cooperative games related to the cost function of the coalitional schemes. The book discusses various cooperative game theory tools that are used to measure/analyze the players’ features, impose constraints on them, provide alternative methods of game computation, detect critical players inside the control scheme, and perform system partitioning of large-scale systems, such as the Barcelona drinking water network, which is described in a case study.
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.
Author: Bezalel Peleg
Publisher: Springer Science & Business Media
ISBN: 3540729453
Category : Business & Economics
Languages : en
Pages : 336
Get Book Here
Book Description
This book systematically presents the main solutions of cooperative games: the core, bargaining set, kernel, nucleolus, and the Shapley value of TU games as well as the core, the Shapley value, and the ordinal bargaining set of NTU games. The authors devote a separate chapter to each solution, wherein they study its properties in full detail. In addition, important variants are defined or even intensively analyzed.
Author: Satya R. Chakravarty
Publisher: Cambridge University Press
ISBN: 1107058791
Category : Business & Economics
Languages : en
Pages : 277
Get Book Here
Book Description
"Deals with real life situations where objectives of the participants are partially cooperative and partially conflicting"--
Author: Berthold Vöcking
Publisher: Springer
ISBN: 3642413927
Category : Computers
Languages : en
Pages : 280
Get Book Here
Book Description
This book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013. The 25 papers presented in this volume were carefully reviewed and selected from 65 submissions. They cover various important aspects of algorithmic game theory, such as solution concepts in game theory, efficiency of equilibria and the price of anarchy, computational aspects of equilibria and game theoretical measures, repeated games and convergence of dynamics, evolution and learning in games, coordination and collective action, network games and graph-theoretic aspects of social networks, voting and social choice, as well as algorithmic mechanism design.
Author: Ding-Zhu Du
Publisher: Springer
ISBN: 3642387683
Category : Computers
Languages : en
Pages : 877
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.
