Download or read book The Oxford Handbook of Well Being and Public Policy written by Matthew D. Adler and published by Oxford University Press. This book was released on 2016-04-21 with total page 985 pages. Available in PDF, EPUB and Kindle. Book excerpt: What are the methodologies for assessing and improving governmental policy in light of well-being? The Oxford Handbook of Well-Being and Public Policy provides a comprehensive, interdisciplinary treatment of this topic. The contributors draw from welfare economics, moral philosophy, and psychology and are leading scholars in these fields. The Handbook includes thirty chapters divided into four Parts. Part I covers the full range of methodologies for evaluating governmental policy and assessing societal condition-including both the leading approaches in current use by policymakers and academics (such as GDP, cost-benefit analysis, cost-effectiveness analysis, inequality and poverty metrics, and the concept of the "social welfare function"), and emerging techniques. Part II focuses on the nature of well-being. What, most fundamentally, determines whether an individual life is better or worse for the person living it? Her happiness? Her preference-satisfaction? Her attainment of various "objective goods"? Part III addresses the measurement of well-being and the thorny topic of interpersonal comparisons. How can we construct a meaningful scale of individual welfare, which allows for comparisons of well-being levels and differences, both within one individual's life, and across lives? Finally, Part IV reviews the major challenges to designing governmental policy around individual well-being.

Download or read book Handbook of Computational Social Choice written by Felix Brandt and published by Cambridge University Press. This book was released on 2016-04-25 with total page 553 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Download or read book Fair Allocation written by H. Peyton Young and published by American Mathematical Soc.. This book was released on 1985-12-31 with total page 188 pages. Available in PDF, EPUB and Kindle. Book excerpt: This collection of six papers provides a valuable source of material on the real-world problem of allocating objects among competing claimants. The examples given show how mathematics, particularly the axiomatic method, can be applied to give insight into complex social problems. Originally presented as an AMS Short Course, these papers could serve as a suitable text for courses touching on game theory, decision sciences, economics, or quantitative political science. Most of the material is accessible to the mathematically mature undergraduate with a background in advanced calculus and algebra. Each article surveys the recent literature and includes statements and sketches of proofs, as well as unsolved problems which should excite student curiosity. The articles analyze the question of fair allocation via six examples: the apportionment of political representation, the measurement of income inequality, the allocation of joint costs, the levying of taxes, the design of voting laws, and the framing of auction procedures. In each of these examples fairness has a somewhat different significance, but common axiomatic threads reveal broad underlying principles. Each of the topics is concerned with norms of comparative equity for evaluating allocations or with standards of procedures for effecting them; it is this focus on normative properties which suggests that a mathematical analysis is appropriate. Though game theory provides a useful tool in many of these allocation problems, the emphasis here is on standards rather than strategy and equity rather than rationality, an approach which more accurately mirrors real-world social problems.

Download or read book Allocation in Networks written by Jens Leth Hougaard and published by MIT Press. This book was released on 2018-11-06 with total page 297 pages. Available in PDF, EPUB and Kindle. Book excerpt: A comprehensive overview of networks and economic design, presenting models and results drawn from economics, operations research, and computer science; with examples and exercises. This book explores networks and economic design, focusing on the role played by allocation rules (revenue and cost-sharing schemes) in creating and sustaining efficient network solutions. It takes a normative approach, seeking economically efficient network solutions sustained by distributional fairness, and considers how different ways of allocating liability affect incentives for network usage and development. The text presents an up-to-date overview of models and results currently scattered over several strands of literature, drawing on economics, operations research, and computer science. The book's analysis of allocation problems includes such classic models from combinatorial optimization as the minimum cost spanning tree and the traveling salesman problem. It examines the planner's ability to design mechanisms that will implement efficient network structures, both in large decentralized networks and when there is user-agent information asymmetry. Offering systematic theoretical analyses of various compelling allocation rules in cases of fixed network structures as well as discussions of network design problems, the book covers such topics as tree-structured distribution systems, routing games, organizational hierarchies, the “price of anarchy,” mechanism design, and efficient implementation. Appropriate as a reference for practitioners in network regulation and the network industry or as a text for graduate students, the book offers numerous illustrative examples and end-of-chapter exercises that highlight the concepts and methods presented.

Download or read book Fair Allocation written by H. Peyton Young and published by American Mathematical Soc.. This book was released on 1985 with total page 186 pages. Available in PDF, EPUB and Kindle. Book excerpt: Shows how mathematics, particularly the axiomatic method, can be applied to give insight into complex social problems. This collection provides material on the real-world problem of allocating objects among competing claimants. Each article surveys the literature and includes statements and sketches of proofs, as well as unsolved problems.

Download or read book Fair Division written by Steven J. Brams and published by Cambridge University Press. This book was released on 1996-02-23 with total page 292 pages. Available in PDF, EPUB and Kindle. Book excerpt: Cutting a cake, dividing up the property in an estate, determining the borders in an international dispute - such problems of fair division are ubiquitous. Fair Division treats all these problems and many more through a rigorous analysis of a variety of procedures for allocating goods (or 'bads' like chores), or deciding who wins on what issues, when there are disputes. Starting with an analysis of the well-known cake-cutting procedure, 'I cut, you choose', the authors show how it has been adapted in a number of fields and then analyze fair-division procedures applicable to situations in which there are more than two parties, or there is more than one good to be divided. In particular they focus on procedures which provide 'envy-free' allocations, in which everybody thinks he or she has received the largest portion and hence does not envy anybody else. They also discuss the fairness of different auction and election procedures.

Download or read book Fair Allocation of Government Fault Act written by United States. Congress. House. Committee on the Judiciary. Subcommittee on Administrative Law and Governmental Relations and published by . This book was released on 1986 with total page 124 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Fair Resource Allocation and Rationing at the Bedside written by Marion Danis and published by Oxford University Press, USA. This book was released on 2014-10-09 with total page 481 pages. Available in PDF, EPUB and Kindle. Book excerpt: Priority setting and rationing contribute significantly to affordable and fair healthcare and clinicians play an indispensable role in these processes. This book offers practical strategies for clinicians to allocate resources fairly, to teach about it to students, and to discuss rationing more explicitly in the public arena and the doctor's office.

Download or read book Fair Division and Collective Welfare written by Herve Moulin and published by MIT Press. This book was released on 2004-08-20 with total page 302 pages. Available in PDF, EPUB and Kindle. Book excerpt: The concept of fair division is as old as civil society itself. Aristotle's "equal treatment of equals" was the first step toward a formal definition of distributive fairness. The concept of collective welfare, more than two centuries old, is a pillar of modern economic analysis. Reflecting fifty years of research, this book examines the contribution of modern microeconomic thinking to distributive justice. Taking the modern axiomatic approach, it compares normative arguments of distributive justice and their relation to efficiency and collective welfare. The book begins with the epistemological status of the axiomatic approach and the four classic principles of distributive justice: compensation, reward, exogenous rights, and fitness. It then presents the simple ideas of equal gains, equal losses, and proportional gains and losses. The book discusses three cardinal interpretations of collective welfare: Bentham's "utilitarian" proposal to maximize the sum of individual utilities, the Nash product, and the egalitarian leximin ordering. It also discusses the two main ordinal definitions of collective welfare: the majority relation and the Borda scoring method. The Shapley value is the single most important contribution of game theory to distributive justice. A formula to divide jointly produced costs or benefits fairly, it is especially useful when the pattern of externalities renders useless the simple ideas of equality and proportionality. The book ends with two versatile methods for dividing commodities efficiently and fairly when only ordinal preferences matter: competitive equilibrium with equal incomes and egalitarian equivalence. The book contains a wealth of empirical examples and exercises.

Download or read book A Theory of Fairness and Social Welfare written by Marc Fleurbaey and published by Cambridge University Press. This book was released on 2011-06-13 with total page 315 pages. Available in PDF, EPUB and Kindle. Book excerpt: The definition and measurement of social welfare have been a vexed issue for the past century. This book makes a constructive, easily applicable proposal and suggests how to evaluate the economic situation of a society in a way that gives priority to the worse-off and that respects each individual's preferences over his or her own consumption, work, leisure and so on. This approach resonates with the current concern to go 'beyond the GDP' in the measurement of social progress. Compared to technical studies in welfare economics, this book emphasizes constructive results rather than paradoxes and impossibilities, and shows how one can start from basic principles of efficiency and fairness and end up with concrete evaluations of policies. Compared to more philosophical treatments of social justice, this book is more precise about the definition of social welfare and reaches conclusions about concrete policies and institutions only after a rigorous derivation from clearly stated principles.

Download or read book Mathematical Economics and Game Theory written by R. Henn and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 714 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Fair Play written by Eve Rodsky and published by Penguin. This book was released on 2021-01-05 with total page 385 pages. Available in PDF, EPUB and Kindle. Book excerpt: AN INSTANT NEW YORK TIMES BESTSELLER • A REESE'S BOOK CLUB PICK Tired, stressed, and in need of more help from your partner? Imagine running your household (and life!) in a new way... It started with the Sh*t I Do List. Tired of being the “shefault” parent responsible for all aspects of her busy household, Eve Rodsky counted up all the unpaid, invisible work she was doing for her family—and then sent that list to her husband, asking for things to change. His response was...underwhelming. Rodsky realized that simply identifying the issue of unequal labor on the home front wasn't enough: She needed a solution to this universal problem. Her sanity, identity, career, and marriage depended on it. The result is Fair Play: a time- and anxiety-saving system that offers couples a completely new way to divvy up domestic responsibilities. Rodsky interviewed more than five hundred men and women from all walks of life to figure out what the invisible work in a family actually entails and how to get it all done efficiently. With 4 easy-to-follow rules, 100 household tasks, and a series of conversation starters for you and your partner, Fair Play helps you prioritize what's important to your family and who should take the lead on every chore, from laundry to homework to dinner. “Winning” this game means rebalancing your home life, reigniting your relationship with your significant other, and reclaiming your Unicorn Space—the time to develop the skills and passions that keep you interested and interesting. Stop drowning in to-dos and lose some of that invisible workload that's pulling you down. Are you ready to try Fair Play? Let's deal you in.

Download or read book Rationing and Resource Allocation in Healthcare written by Ezekiel J. Emanuel and published by Oxford University Press. This book was released on 2018 with total page 569 pages. Available in PDF, EPUB and Kindle. Book excerpt: Budgets of governments and private insurances are limited. Not all drugs and services that appear beneficial to patients or physicians can be covered. Is there a core set of benefits that everyone should be entitled to? If so, how should this set be determined? Are fair decisions just impossible, if we know from the outset than not all needs can be met? While early work in bioethics has focused on clinical issues and a narrow set of principles, in recent years there has been a marked shift towards addressing broader population-level issues, requiring consideration of more demanding theories in philosophy, political science, and economics. At the heart of bioethics' new orientation is the goal of clarity on a complex set of questions in rationing and resource allocation. Rationing and Resource Allocation in Healthcare: Essential Readings provides key excerpts from seminal and pertinent texts and case studies about these topics, contextualized by original introductions. The volume is divided into three broad sections: Conceptual Distinctions and Ethical Theory; Rationing; and Resource Allocation. Containing the most important and classic articles surrounding the theoretical and practical issues related to rationing and how to allocate scare medical resources, this collection aims to assist and inform those who wish to be a part of bioethics' 21st century shift including practitioners and policy-makers, and students and scholars in the health sciences, philosophy, law, and medical ethics.

Download or read book Testing Treatments written by Imogen Evans and published by Pinter & Martin Publishers. This book was released on 2011 with total page 187 pages. Available in PDF, EPUB and Kindle. Book excerpt: This work provides a thought-provoking account of how medical treatments can be tested with unbiased or 'fair' trials and explains how patients can work with doctors to achieve this vital goal. It spans the gamut of therapy from mastectomy to thalidomide and explores a vast range of case studies.

Download or read book Fair Weather written by Ferenc L. Tóth and published by Routledge. This book was released on 2019-07-23 with total page 252 pages. Available in PDF, EPUB and Kindle. Book excerpt: Is a unique, cross-disciplinary assessment of fairness and equity issues in the context of global climate change - a crucial dimension in current international negotiations - written by a collection of leading scientists in economics, sociology and social psychology, ethics, international law and political science. How should responsibility for adapting to climate change be distributed? Who should bear the costs of mitigating its impacts and how should these costs be measured? Answers to these questions differ, often according to the vulnerability, wealth and level of industrial development of the country. Finding a fair solution is controversial, but crucial to the complex and vital negotiations over global warming. This illuminating and accessible volume explores the policy dimensions and analytical needs of the negotiation process. It is essential reading for policy makers and students and teachers of economics, sociology and social psychology, ethics, international relations, law and political science. FERENC L TOTH is project leader at the Department of Global Change and Social Systems at the Potsdam Institute for Climate Impact Research (PIK), Germany. CONTRIBUTORS H Asbjorn Aaheim Frank Biermann Samuel Fankhauser Carsten Helm Juliane Kokott Joanne Linnerooth-Bayer Volker Linneweber Elizabeth L Malone Shuzo Nishioka Originally published in 1999 David W Pearce Steve Rayner P R Shukla Dominik Thieme Michael Thompson Richard S J Tol David G Victor

Download or read book Resource Allocation and Performance Optimization in Communication Networks and the Internet written by Liansheng Tan and published by CRC Press. This book was released on 2017-08-15 with total page 503 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a comprehensive introduction to the underlying theory, design techniques and analytical results of wireless communication networks, focusing on the core principles of wireless network design. It elaborates the network utility maximization (NUM) theory with applications in resource allocation of wireless networks, with a central aim of design and the QoS guarantee. It presents and discusses state-of-the-art developments in resource allocation and performance optimization in wireless communication networks. It provides an overview of the general background including the basic wireless communication networks and the relevant protocols, architectures, methods and algorithms.

Download or read book Algorithmic aspects of resource allocation and multiwinner voting theory and experiments written by Kaczmarczyk, Andrzej and published by Universitätsverlag der TU Berlin. This book was released on 2021-12-10 with total page 248 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis is concerned with investigating elements of computational social choice in the light of real-world applications. We contribute to a better understanding of the areas of fair allocation and multiwinner voting. For both areas, inspired by real-world scenarios, we propose several new notions and extensions of existing models. Then, we analyze the complexity of answering the computational questions raised by the introduced concepts. To this end, we look through the lens of parameterized complexity. We identify different parameters which describe natural features specific to the computational problems we investigate. Exploiting the parameters, we successfully develop efficient algorithms for spe- cific cases of the studied problems. We complement our analysis by showing which parameters presumably cannot be utilized for seeking efficient algorithms. Thereby, we provide comprehensive pictures of the computational complexity of the studied problems. Specifically, we concentrate on four topics that we present below, grouped by our two areas of interest. For all but one topic, we present experimental studies based on implementations of newly developed algorithms. We first focus on fair allocation of indivisible resources. In this setting, we consider a collection of indivisible resources and a group of agents. Each agent reports its utility evaluation of every resource and the task is to “fairly” allocate the resources such that each resource is allocated to at most one agent. We concentrate on the two following issues regarding this scenario. The social context in fair allocation of indivisible resources. In many fair allocation settings, it is unlikely that every agent knows all other agents. For example, consider a scenario where the agents represent employees of a large corporation. It is highly unlikely that every employee knows every other employee. Motivated by such settings, we come up with a new model of graph envy-freeness by adapting the classical envy-freeness notion to account for social relations of agents modeled as social networks. We show that if the given social network of agents is simple (for example, if it is a directed acyclic graph), then indeed we can sometimes find fair allocations efficiently. However, we contrast tractability results with showing NP-hardness for several cases, including those in which the given social network has a constant degree. Fair allocations among few agents with bounded rationality. Bounded rationality is the idea that humans, due to cognitive limitations, tend to simplify problems that they face. One of its emanations is that human agents usually tend to report simple utilities over the resources that they want to allocate; for example, agents may categorize the available resources only into two groups of desirable and undesirable ones. Applying techniques for solving integer linear programs, we show that exploiting bounded rationality leads to efficient algorithms for finding envy-free and Pareto-efficient allocations, assuming a small number of agents. Further, we demonstrate that our result actually forms a framework that can be applied to a number of different fairness concepts like envy-freeness up to one good or envy-freeness up to any good. This way, we obtain efficient algorithms for a number of fair allocation problems (assuming few agents with bounded rationality). We also empirically show that our technique is applicable in practice. Further, we study multiwinner voting, where we are given a collection of voters and their preferences over a set of candidates. The outcome of a multiwinner voting rule is a group (or a set of groups in case of ties) of candidates that reflect the voters’ preferences best according to some objective. In this context, we investigate the following themes. The robustness of election outcomes. We study how robust outcomes of multiwinner elections are against possible mistakes made by voters. Assuming that each voter casts a ballot in a form of a ranking of candidates, we represent a mistake by a swap of adjacent candidates in a ballot. We find that for rules such as SNTV, k-Approval, and k-Borda, it is computationally easy to find the minimum number of swaps resulting in a change of an outcome. This task is, however, NP-hard for STV and the Chamberlin-Courant rule. We conclude our study of robustness with experimentally studying the average number of random swaps leading to a change of an outcome for several rules. Strategic voting in multiwinner elections. We ask whether a given group of cooperating voters can manipulate an election outcome in a favorable way. We focus on the k-Approval voting rule and we show that the computational complexity of answering the posed question has a rich structure. We spot several cases for which our problem is polynomial-time solvable. However, we also identify NP-hard cases. For several of them, we show how to circumvent the hardness by fixed-parameter tractability. We also present experimental studies indicating that our algorithms are applicable in practice. Diese Arbeit befasst sich mit der Untersuchung von Themen des Forschungsgebiets Computational Social Choice im Lichte realer Anwendungen. Dabei trägt sie zu einem besseren Verständnis der Bereiche der fairen Zuordnung und der Mehrgewinnerwahlen bei. Für beide Konzepte schlagen wir – inspiriert von realen Anwendungen – verschiedene neue Begriffe und Erweiterungen bestehender Modelle vor. Anschließend analysieren wir die Komplexität der Beantwortung von Berechnungsfragen, die durch die eingeführten Konzepte aufgeworfen werden. Dabei fokussieren wir uns auf die parametrisierte Komplexität. Hierzu identifizieren wir verschiedene Parameter, welche natürliche Merkmale der von uns untersuchten Berechnungsprobleme beschreiben. Durch die Nutzung dieser Parameter entwickeln wir erfolgreich effiziente Algorithmen für Spezialfälle der untersuchten Probleme. Wir ergänzen unsere Analyse indem wir zeigen, welche Parameter vermutlich nicht verwendet werden können um effiziente Algorithmen zu finden. Dabei zeichnen wir ein umfassendes Bild der Berechnungskomplexität der untersuchten Probleme. Insbesondere konzentrieren wir uns auf vier Themen, die wir, gruppiert nach unseren beiden Schwerpunkten, unten vorstellen. Für alle Themen bis auf eines präsentieren wir Experimente, die auf Implementierungen der von uns neu entwickelten Algorithmen basieren. Wir konzentrieren uns zunächst auf die faire Zuordnung unteilbarer Ressourcen. Hier betrachten wir eine Menge unteilbarer Ressourcen und eine Gruppe von Agenten. Jeder Agent gibt eine Bewertung des Nutzens jeder Ressource ab und die Aufgabe besteht darin, eine "faire" Zuordnung der Ressourcen zu finden, wobei jede Ressource höchstens einem Agenten zugeordnet werden kann. Innerhalb dieses Bereiches konzentrieren wir uns auf die beiden folgenden Problemstellungen. Der soziale Kontext bei der fairen Zuordnung unteilbarer Ressourcen. In vielen Szenarien, in denen Ressourcen zugeordnet werden sollen, ist es unwahrscheinlich, dass jeder Agent alle anderen kennt. Vorstellbar ist beispielsweise ein Szenario, in dem die Agenten Mitarbeiter eines großen Unternehmens repräsentieren. Es ist höchst unwahrscheinlich, dass jeder Mitarbeiter jeden anderen Mitarbeiter kennt. Motiviert durch solche Szenarien entwickeln wir ein neues Modell der graph-basierten Neidfreiheit. Wir erweitern den klassischen Neidfreiheitsbegriff um die sozialen Beziehungen von Agenten, die durch soziale Netzwerke modelliert werden. Einerseits zeigen wir, dass wenn das soziale Netzwerk der Agenten einfach ist (zum Beispiel, wenn es sich um einen gerichteten azyklischen Graph handelt), in manchen Fällen faire Zuordnungen effizient gefunden werden können. Andererseits stellen wir diesen algorithmisch positiven Ergebnissen mehrere NP-schweren Fällen entgegen. Ein Beispiel für einen solchen Fall sind soziale Netzwerke mit einem konstanten Knotengrad. Faire Zuteilung an wenige Agenten mit begrenzter Rationalität. Begrenzte Rationalität beschreibt die Idee, dass Menschen aufgrund kognitiver Grenzen dazu neigen, Probleme, mit denen sie konfrontiert werden, zu vereinfachen. Eine mögliche Folge dieser Grenzen ist, dass menschliche Agenten in der Regel einfache Bewertungen der gewünschten Ressourcen abgeben; beispielsweise könnten Agenten die verfügbaren Ressourcen nur in zwei Gruppen, erwünschte und unerwünschte Ressourcen, kategorisieren. Durch Anwendung von Techniken zum Lösen von Ganzzahligen Linearen Programmen zeigen wir, dass unter der Annahme einer kleinen Anzahl von Agenten die Ausnutzung begrenzter Rationalität dabei hilft, effiziente Algorithmen zum Finden neidfreier und Pareto-effizienter Zuweisungen zu entwickeln. Weiterhin zeigen wir, dass unser Ergebnis ein allgemeines Verfahren liefert, welches auf eine Reihe verschiedener Fairnesskonzepte angewendet werden kann, wie zum Beispiel Neidfreiheit bis auf ein Gut oder Neidfreiheit bis auf irgendein Gut. Auf diese Weise gewinnen wir effiziente Algorithmen für eine Reihe fairer Zuordnungsprobleme (wenige Agenten mit begrenzter Rationalität vorausgesetzt). Darüber hinaus zeigen wir empirisch, dass unsere Technik in der Praxis anwendbar ist. Weiterhin untersuchen wir Mehrgewinnerwahlen, bei denen uns eine Menge von Wählern sowie ihre Präferenzen über eine Reihe von Kandidaten gegeben sind. Das Ergebnis eines Mehrgewinnerwahlverfahrens ist eine Gruppe (oder eine Menge von Gruppen im Falle eines Unentschiedens) von Kandidaten, welche die Präferenzen der Wähler am besten einem bestimmten Ziel folgend widerspiegeln. In diesem Kontext untersuchen wir die folgenden Themen. Die Robustheit von Wahlergebnissen. Wir untersuchen, wie robust die Ergebnisse von Mehrgewinnerwahlen gegenüber möglicher Fehler der Wähler sind. Unter der Annahme, dass jeder Wähler eine Stimme in Form einer Rangliste von Kandidaten abgibt, modellieren wir einen Fehler als einen Tausch benachbarter Kandidaten in der Rangliste. Wir zeigen, dass für Wahlregeln wie SNTV, k-Approval und k-Borda die minimale Anzahl an Vertauschungen, welche zu einer Ergebnisänderung führt, einfach zu berechnen ist. Für STV und die Chamberlin-Courant-Regel ist diese Aufgabe allerdings NP-schwer. Wir schließen unsere Untersuchung der Robustheit unterschiedlicher Wahlregeln ab mit einer experimentellen Evaluierung der durchschnittlichen Anzahl zufälliger Vertauschungen, die zu einer Änderung des Ergebnisses führen. Strategische Abstimmung bei Wahlen mit mehreren Gewinnern. Wir fragen, ob eine bestimmte Gruppe von kooperierenden Wählern ein Wahlergebnis zu ihren Gunsten manipulieren kann. Dabei konzentrieren wir uns auf die k-Approval-Wahlregel. Wir zeigen, dass die Berechnungskomplexität der besagten Manipulation eine reiche Struktur besitzt. Auf der einen Seite identifizieren wir mehrere Fälle in denen das Problem in Polynomzeit lösbar ist. Auf der anderen Seite identifizieren wir jedoch auch NP-schwere Fälle. Für einige von ihnen zeigen wir, wie die Berechnungsschwere durch parametrisierte Algorithmen umgangen werden kann. Wir präsentieren zudem experimentelle Untersuchungen, welche darauf hindeuten, dass unsere Algorithmen in der Praxis anwendbar sind.