Two-Sided Matching


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




Two-Sided Matching


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.




Algorithmics of Matching Under Preferences


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."




The Stable Marriage Problem


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.




Market Design


Book Description

A broad overview of market mechanisms, with an emphasis on the interplay between theory and real-life applications; examples range from eBay auctions to school choice. This book offers an introduction to market design, providing students with a broad overview of issues related to the design and analysis of market mechanisms. It defines a market as a demand and a supply, without specifying a price system or mechanism. This allows the text to analyze a broad set of situations—including such unconventional markets as college admissions and organ donation—and forces readers to pay attention to details that might otherwise be overlooked. Students often complain that microeconomics is too abstract and disconnected from reality; the study of market design shows how theory can help solve existing, real-life problems. The book focuses on the interplay between theory and applications. To keep the text as accessible as possible, special effort has been made to minimize formal description of the models while emphasizing the intuitive, with detailed explanations and resolution of examples. Appendixes offer general reviews of elements of game theory and mechanism design that are related to the themes explored in the book, presenting the basic concepts with as many explanations and illustrations as possible. The book covers topics including the basics of simple auctions; eBay auctions; Vickrey–Clarke–Groves auctions; keyword auctions, with examples from Google and Facebook; spectrum auctions; financial markets, with discussions of treasury auctions and IPOs; trading on the stock market; the basic matching model; medical match; assignment problems; probabilistic assignments; school choice; course allocation, with examples from Harvard and Wharton; and kidney exchange.







Discrete Convex Analysis


Book Description

Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis.




Stable Marriage and Its Relation to Other Combinatorial Problems


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.




Advances in Artificial Systems for Logistics Engineering


Book Description

The book comprises high-quality refereed research papers presented at the Second International Conference on Artificial Intelligence and Logistics Engineering (ICAILE2022), held in Kyiv, Ukraine, on February 20–22, 2022, organized jointly by the National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute," Wuhan University of Technology, Nanning University, National Aviation University, and the International Research Association of Modern Education and Computer Science. The topics discussed in the book include state-of-the-art papers in artificial intelligence and logistics engineering. It is an excellent source of references for researchers, graduate students, engineers, management practitioners, and undergraduate students interested in artificial intelligence and its applications in logistics engineering.




Incentives and Two-Sided Matching - Engineering Coordination Mechanisms for Social Clouds


Book Description

The Social Cloud framework leverages existing relationships between members of a social network for the exchange of resources. This thesis focuses on the design of coordination mechanisms to address two challenges in this scenario. In the first part, user participation incentives are studied. In the second part, heuristics for two-sided matching-based resource allocation are designed and evaluated.