Algorithmics of Matching Under Preferences
Algorithmics of Matching Under Preferences

Author: David F. Manlove

Publisher: World Scientific

Published: 2013

Total Pages: 524

ISBN-13: 9814425257

DOWNLOAD EBOOK

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

Two-Sided Matching
Two-Sided Matching

Author: Alvin E. Roth

Publisher: Cambridge University Press

Published: 1992-06-26

Total Pages: 288

ISBN-13: 1107782430

DOWNLOAD EBOOK

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

The Stable Marriage Problem
The Stable Marriage Problem

Author: Dan Gusfield

Publisher:

Published: 1989

Total Pages: 0

ISBN-13: 9780262515528

DOWNLOAD EBOOK

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.

Algorithmics Of Matching Under Preferences
Algorithmics Of Matching Under Preferences

Author: David Manlove

Publisher: World Scientific

Published: 2013-03-20

Total Pages: 524

ISBN-13: 9814425265

DOWNLOAD EBOOK

Matching problems with preferences are all around us: 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. The importance of the research area was recognised in 2012 through the award of the Nobel Prize in Economic Sciences to Alvin Roth and Lloyd Shapley.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.

Trends in Computational Social Choice
Trends in Computational Social Choice

Author: Ulle Endriss

Publisher: Lulu.com

Published: 2017

Total Pages: 424

ISBN-13: 1326912097

DOWNLOAD EBOOK

Computational social choice is concerned with the design and analysis of methods for collective decision making. It is a research area that is located at the interface of computer science and economics. The central question studied in computational social choice is that of how best to aggregate the individual points of view of several agents, so as to arrive at a reasonable compromise. Examples include tallying the votes cast in an election, aggregating the professional opinions of several experts, and finding a fair manner of dividing a set of resources amongst the members of a group -- Back cover.

Platform Business Models
Platform Business Models

Author: R. Srinivasan

Publisher: Springer Nature

Published: 2021-06-13

Total Pages: 352

ISBN-13: 9811628386

DOWNLOAD EBOOK

This book introduces platform firms as unique business models. Leveraging on the early literature on network economics and strategy frameworks, this book explores how platform business firms evolve in the modern business world. Taking a strategic perspective, this book engages the reader with core concepts, case studies, and frameworks for analyzing platform business firms. This book differentiates platform business firms from traditional pipeline firms; explores engagement with different actors, value creation, and operations of platforms; elucidates resources and capabilities of platform firms that provide them sustained competitive advantage; analyzes performance levers in operating platform business models, including complementarities with other business models; and discusses the sustainability of platform business models, in the face of regulatory and societal challenges, among others. The book is designed as a primer for entrepreneurs setting up and operating platform business firms, senior managers in large corporations repurposing their resources to initiate network dynamics in their businesses, early career managers, and professionals engaging with myriad platform firms for their professional and personal needs. This book intends to provide a decision-maker with a portfolio of decisions to make to create, operate, sustain, and generate value out of a platform business firm. It is also useful for policy professionals to appreciate the economics and policy implications of regulating and governing platforms in a post-digital world.

Online Matching and Ad Allocation
Online Matching and Ad Allocation

Author: Aranyak Mehta

Publisher:

Published: 2013-10-01

Total Pages: 120

ISBN-13: 9781601987181

DOWNLOAD EBOOK

Matching is a classic problem with a rich history and a significant impact on both the theory of algorithms and in practice. Recently, there has been a surge of interest in the online version of matching and its generalizations. This is due to the important new application domain of Internet advertising. The theory of online matching and allocation has played a critical role in designing algorithms for ad allocation. Online Matching and Ad Allocation surveys the key problems, models, and algorithms from online matchings, as well as their implication in the practice of ad allocation. It provides a classification of the problems in this area, an introduction into the techniques used, a glimpse into the practical impact, and ponders some of the open questions that will be of interest in the future. Matching continues to find core applications in diverse domains, and the advent of massive online and streaming data emphasizes the future applicability of the algorithms and techniques surveyed here. Online Matching and Ad Allocation is an ideal primer for anyone interested in matching, and particularly in the online version of the problem, in bipartite graphs.

Matching Theory
Matching Theory

Author: László Lovász

Publisher: American Mathematical Soc.

Published: 2009

Total Pages: 610

ISBN-13: 0821847597

DOWNLOAD EBOOK

This book surveys matching theory, with an emphasis on connections with other areas of mathematics and on the role matching theory has played, and continues to play, in the development of some of these areas. Besides basic results on the existence of matchings and on the matching structure of graphs, the impact of matching theory is discussed by providing crucial special cases and nontrivial examples on matroid theory, algorithms, and polyhedral combinatorics. The new Appendix outlines how the theory and applications of matching theory have continued to develop since the book was first published in 1986, by launching (among other things) the Markov Chain Monte Carlo method.

Answer Set Programming
Answer Set Programming

Author: Vladimir Lifschitz

Publisher: Springer Nature

Published: 2019-08-29

Total Pages: 196

ISBN-13: 3030246582

DOWNLOAD EBOOK

Answer set programming (ASP) is a programming methodology oriented towards combinatorial search problems. In such a problem, the goal is to find a solution among a large but finite number of possibilities. The idea of ASP came from research on artificial intelligence and computational logic. ASP is a form of declarative programming: an ASP program describes what is counted as a solution to the problem, but does not specify an algorithm for solving it. Search is performed by sophisticated software systems called answer set solvers. Combinatorial search problems often arise in science and technology, and ASP has found applications in diverse areas—in historical linguistic, in bioinformatics, in robotics, in space exploration, in oil and gas industry, and many others. The importance of this programming method was recognized by the Association for the Advancement of Artificial Intelligence in 2016, when AI Magazine published a special issue on answer set programming. The book introduces the reader to the theory and practice of ASP. It describes the input language of the answer set solver CLINGO, which was designed at the University of Potsdam in Germany and is used today by ASP programmers in many countries. It includes numerous examples of ASP programs and present the mathematical theory that ASP is based on. There are many exercises with complete solutions.

Combinatorial Optimization
Combinatorial Optimization

Author: Bernhard Korte

Publisher: Springer Science & Business Media

Published: 2006-01-27

Total Pages: 596

ISBN-13: 3540292977

DOWNLOAD EBOOK

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.