108 research outputs found
2017 GREAT Day Program
SUNY Geneseo’s Eleventh Annual GREAT Day.https://knightscholar.geneseo.edu/program-2007/1011/thumbnail.jp
Fault Tolerance in Euclidean Committee Selection
In the committee selection problem, the goal is to choose a subset of size
from a set of candidates that collectively gives the best
representation to a set of voters. We consider this problem in Euclidean
-space where each voter/candidate is a point and voters' preferences are
implicitly represented by Euclidean distances to candidates. We explore
fault-tolerance in committee selection and study the following three variants:
(1) given a committee and a set of failing candidates, find their optimal
replacement; (2) compute the worst-case replacement score for a given committee
under failure of candidates; and (3) design a committee with the best
replacement score under worst-case failures. The score of a committee is
determined using the well-known (min-max) Chamberlin-Courant rule: minimize the
maximum distance between any voter and its closest candidate in the committee.
Our main results include the following: (1) in one dimension, all three
problems can be solved in polynomial time; (2) in dimension , all
three problems are NP-hard; and (3) all three problems admit a constant-factor
approximation in any fixed dimension, and the optimal committee problem has an
FPT bicriterion approximation.Comment: The paper will appear in the proceedings of ESA 202
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Fault Tolerance in Euclidean Committee Selection
In the committee selection problem, the goal is to choose a subset of size k from a set of candidates C that collectively gives the best representation to a set of voters. We consider this problem in Euclidean d-space where each voter/candidate is a point and voters\u27 preferences are implicitly represented by Euclidean distances to candidates. We explore fault-tolerance in committee selection and study the following three variants: (1) given a committee and a set of f failing candidates, find their optimal replacement; (2) compute the worst-case replacement score for a given committee under failure of f candidates; and (3) design a committee with the best replacement score under worst-case failures. The score of a committee is determined using the well-known (min-max) Chamberlin-Courant rule: minimize the maximum distance between any voter and its closest candidate in the committee. Our main results include the following: (1) in one dimension, all three problems can be solved in polynomial time; (2) in dimension d ? 2, all three problems are NP-hard; and (3) all three problems admit a constant-factor approximation in any fixed dimension, and the optimal committee problem has an FPT bicriterion approximation
2018 GREAT Day Program
SUNY Geneseo’s Twelfth Annual GREAT Day.https://knightscholar.geneseo.edu/program-2007/1012/thumbnail.jp
LIPIcs, Volume 274, ESA 2023, Complete Volume
LIPIcs, Volume 274, ESA 2023, Complete Volum
Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting
We investigate the complexity of several manipulation and control problems
under numerous prevalent approval-based multiwinner voting rules. Particularly,
the rules we study include approval voting (AV), satisfaction approval voting
(SAV), net-satisfaction approval voting (NSAV), proportional approval voting
(PAV), approval-based Chamberlin-Courant voting (ABCCV), minimax approval
voting (MAV), etc. We show that these rules generally resist the strategic
types scrutinized in the paper, with only a few exceptions. In addition, we
also obtain many fixed-parameter tractability results for these problems with
respect to several natural parameters, and derive polynomial-time algorithms
for certain special cases.Comment: 45pages, 1figure, full version of a paper at IJCAI 201
Deliberation in the public policies planning process
Over the last decades much has been written about the role of deliberation in public life, and much is still being written. This does not mean that the idea of deliberation is no longer a flickering mirage, and the deliberative recommendations and the results of practices can be fully satisfied. In the literature on deliberation, as well as in the sphere of deliberative practices, there are examples more and less valuable. (...) When we started working on the book, we tried to compose a work at a good academic level, which would not lack bolder theoretical interpretations, and at the same time it would be as free as possible from reproducing empty words. We leave the readers to judge the extent to which we have managed to do so. And we do so (as we hope) without self-righteousness, but also without anxiety, because we managed to gather a precisely selected group of authors which in our opinion guarantees academic reliability as well as practical awareness.The study consists of ten texts. The first three chapters focus on theoretical issues and the remaining seven take a more practical and functional approach
How to Achieve Inclusive Growth
Rising inequality and widespread poverty, social unrest and polarization, gender and ethnic disparities, declining social mobility, economic fragility, unbalanced growth due to technology and globalization, and existential danger from climate change are urgent global concerns of our day. These issues are intertwined. They therefore require a holistic framework to examine their interplay and bring the various strands together. This book brings together leading academic economists and experts from several international institutions to explain the sources and scale of these challenges. The book summarizes a wide array of empirical evidence and country experiences, lays out practical policy solutions, and devises a comprehensive and unified plan of action for combatting these economic and social disparities. This authoritative book is accessible to policy makers, students, and the general public interested in how to craft a brighter future by building a sustainable, green, and inclusive society in the years ahead
- …