Stable Matchings and the Small Core in Nash Equilibrium in the College Admissions Problem PDF Download

Author: Jinpeng Ma
Publisher:
ISBN:
Category : Universities and colleges
Languages : en
Pages : 52

View

Book Description

Author: Alvin E. Roth
Publisher: Cambridge University Press
ISBN: 1107782430
Category : Business & Economics
Languages : en
Pages : 288

View

Book Description
Two-sided matching provides a model of search processes such as those between firms and workers in labor markets or between buyers and sellers in auctions. This book gives a comprehensive account of recent results concerning the game-theoretic analysis of two-sided matching. The focus of the book is on the stability of outcomes, on the incentives that different rules of organization give to agents, and on the constraints that these incentives impose on the ways such markets can be organized. The results for this wide range of related models and matching situations help clarify which conclusions depend on particular modeling assumptions and market conditions, and which are robust over a wide range of conditions. 'This book chronicles one of the outstanding success stories of the theory of games, a story in which the authors have played a major role: the theory and practice of matching markets ... The authors are to be warmly congratulated for this fine piece of work, which is quite unique in the game-theoretic literature.' From the Foreword by Robert Aumann

Author: Karl Shell
Publisher:
ISBN:
Category :
Languages : en
Pages : 464

View

Book Description

Author: Robert A. Meyers
Publisher: Springer
ISBN: 9781461417996
Category : Computers
Languages : en
Pages : 0

View

Book Description
Complex systems are systems that comprise many interacting parts with the ability to generate a new quality of collective behavior through self-organization, e.g. the spontaneous formation of temporal, spatial or functional structures. These systems are often characterized by extreme sensitivity to initial conditions as well as emergent behavior that are not readily predictable or even completely deterministic. The recognition that the collective behavior of the whole system cannot be simply inferred from an understanding of the behavior of the individual components has led to the development of numerous sophisticated new computational and modeling tools with applications to a wide range of scientific, engineering, and societal phenomena. Computational Complexity: Theory, Techniques and Applications presents a detailed and integrated view of the theoretical basis, computational methods, and state-of-the-art approaches to investigating and modeling of inherently difficult problems whose solution requires extensive resources approaching the practical limits of present-day computer systems. This comprehensive and authoritative reference examines key components of computational complexity, including cellular automata, graph theory, data mining, granular computing, soft computing, wavelets, and more.

Author: Anna R. Karlin
Publisher: American Mathematical Soc.
ISBN: 1470419823
Category : Mathematics
Languages : en
Pages : 400

View

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.

Author: Tim Roughgarden
Publisher: Cambridge University Press
ISBN: 1316781178
Category : Computers
Languages : en
Pages : 356

View

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: Dan Gusfield
Publisher:
ISBN: 9780262515528
Category : Combinatorial analysis
Languages : en
Pages : 0

View

Book Description
This book probes the stable marriage problem and its variants as a rich source of problems and ideas that illustrate both the design and analysis of efficient algorithms. It covers the most recent structural and algorithmic work on stable matching problems, simplifies and unifies many earlier proofs, strengthens several earlier results, and presents new results and more efficient algorithms.The authors develop the structure of the set of stable matchings in the stable marriage problem in a more general and algebraic context than has been done previously; they discuss the problem's structure in terms of rings of sets, which allows many of the most useful features to be seen as features of a more general set of problems. The relationship between the structure of the stable marriage problem and the more general stable roommates problem is demonstrated, revealing many commonalities.The results the authors obtain provide an algorithmic response to the practical, and political, problems created by the asymmetry inherent in the Gale Shapley solutions, leading to alternative methods and better compromises than are provided by the Gale Shapley method. And, in contrast to Donald Knuth's earlier work which primarily focused on the application of mathematics to the analysis of algorithms, this book illustrates the productive and almost inseparable relationship between mathematical insight and the design of efficient algorithms.Dan Gusfield is Associate Professor of Computer Science at the University of California, Davis. Robert W. Irving is Senior Lecturer in Computing Science at the University of Glasgow. The Stable Marriage Problem is included in the Foundations of Computing Series, edited by Michael Garey and Albert Meyer.

Author: David F. Manlove
Publisher: World Scientific
ISBN: 9814425257
Category : Mathematics
Languages : en
Pages : 524

View

Book Description
Matching problems with preferences are all around us OCo they arise when agents seek to be allocated to one another on the basis of ranked preferences over potential outcomes. Efficient algorithms are needed for producing matchings that optimise the satisfaction of the agents according to their preference lists.In recent years there has been a sharp increase in the study of algorithmic aspects of matching problems with preferences, partly reflecting the growing number of applications of these problems worldwide. This book describes the most important results in this area, providing a timely update to The Stable Marriage Problem: Structure and Algorithms (D Gusfield and R W Irving, MIT Press, 1989) in connection with stable matching problems, whilst also broadening the scope to include matching problems with preferences under a range of alternative optimality criteria."

Author: Martin J. Osborne
Publisher: Open Book Publishers
ISBN: 180511123X
Category : Business & Economics
Languages : en
Pages : 382

View

Book Description
Models in Microeconomic Theory covers basic models in current microeconomic theory. Part I (Chapters 1-7) presents models of an economic agent, discussing abstract models of preferences, choice, and decision making under uncertainty, before turning to models of the consumer, the producer, and monopoly. Part II (Chapters 8-14) introduces the concept of equilibrium, beginning, unconventionally, with the models of the jungle and an economy with indivisible goods, and continuing with models of an exchange economy, equilibrium with rational expectations, and an economy with asymmetric information. Part III (Chapters 15-16) provides an introduction to game theory, covering strategic and extensive games and the concepts of Nash equilibrium and subgame perfect equilibrium. Part IV (Chapters 17-20) gives a taste of the topics of mechanism design, matching, the axiomatic analysis of economic systems, and social choice. The book focuses on the concepts of model and equilibrium. It states models and results precisely, and provides proofs for all results. It uses only elementary mathematics (with almost no calculus), although many of the proofs involve sustained logical arguments. It includes about 150 exercises. With its formal but accessible style, this textbook is designed for undergraduate students of microeconomics at intermediate and advanced levels.

Author: Donald Ervin Knuth
Publisher: American Mathematical Soc.
ISBN: 0821806033
Category : Mathematics
Languages : en
Pages : 90

View

Book Description
Uses the theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms.