20,747 research outputs found
Fully Proportional Representation as Resource Allocation: Approximability Results
We model Monroe's and Chamberlin and Courant's multiwinner voting systems as
a certain resource allocation problem. We show that for many restricted
variants of this problem, under standard complexity-theoretic assumptions,
there are no constant-factor approximation algorithms. Yet, we also show cases
where good approximation algorithms exist (briefly put, these variants
correspond to optimizing total voter satisfaction under Borda scores, within
Monroe's and Chamberlin and Courant's voting systems).Comment: 26 pages, 1 figur
PREFERENCE-AWARE TASK ASSIGNMENT IN MOBILE CROWDSENSING
Mobile crowdsensing (MCS) is an emerging form of crowdsourcing, which facilitates the sensing data collection with the help of mobile participants (workers). A central problem in MCS is the assignment of sensing tasks to workers. Existing work in the field mostly seek a system-level optimization of task assignments (e.g., maximize the number of completed tasks, minimize the total distance traveled by workers) without considering individual preferences of task requesters and workers. However, users may be reluctant to participate in MCS campaigns that disregard their preferences. In this dissertation, we argue that user preferences should be a primary concern in the task assignment process for an MCS campaign to be effective, and we develop preference-aware task assignment (PTA) mechanisms for five different MCS settings. Since the PTA problem is computationally hard in most of these settings, we present efficient approximation and heuristic algorithms. Extensive simulations performed on synthetic and real data sets validate our theoretical results, and demonstrate that the proposed algorithms produce near-optimal solutions in terms of preference-awareness, outperforming the state-of-the-art assignment algorithms by a wide margin in most cases
Solving Hard Stable Matching Problems Involving Groups of Similar Agents
Many important stable matching problems are known to be NP-hard, even when
strong restrictions are placed on the input. In this paper we seek to identify
structural properties of instances of stable matching problems which will allow
us to design efficient algorithms using elementary techniques. We focus on the
setting in which all agents involved in some matching problem can be
partitioned into k different types, where the type of an agent determines his
or her preferences, and agents have preferences over types (which may be
refined by more detailed preferences within a single type). This situation
would arise in practice if agents form preferences solely based on some small
collection of agents' attributes. We also consider a generalisation in which
each agent may consider some small collection of other agents to be
exceptional, and rank these in a way that is not consistent with their types;
this could happen in practice if agents have prior contact with a small number
of candidates. We show that (for the case without exceptions), several
well-studied NP-hard stable matching problems including Max SMTI (that of
finding the maximum cardinality stable matching in an instance of stable
marriage with ties and incomplete lists) belong to the parameterised complexity
class FPT when parameterised by the number of different types of agents needed
to describe the instance. For Max SMTI this tractability result can be extended
to the setting in which each agent promotes at most one `exceptional' candidate
to the top of his/her list (when preferences within types are not refined), but
the problem remains NP-hard if preference lists can contain two or more
exceptions and the exceptional candidates can be placed anywhere in the
preference lists, even if the number of types is bounded by a constant.Comment: Results on SMTI appear in proceedings of WINE 2018; Section 6
contains work in progres
PREFERENCE DRIVEN UNIVERSITY COURSE SCHEDULING SYSTEM
University course planning and scheduling is the process of determining what courses to offer, how many sections are needed, determining the best term to offer each section, assigning a faculty member to instruct each section, and scheduling each section to a timeslot to avoid conflicts. The result of this task has an impact on every student and faculty member in the department. The process is typically broken down into three major phases: course offering planning, faculty assignment to planned course sections, and course scheduling into timeslots.
This thesis looks at each of these phases for the Industrial and Manufacturing department and brings them together into a decision support and scheduling system. A decision support tool is created to facilitate planning of course offerings. Operations research is applied to assign sections to faculty members using a faculty preference driven integer linear programming model in order to minimize dissatisfaction in the department. Next, the faculty-section pairs are scheduled into university timeslots using a complex integer linear programming model. This scheduling model takes into consideration the faculty member time availability and preferences and general student time slot preferences as it minimizes dissatisfaction while avoiding conflicts among labs, faculty members and courses offered for each class level
Union Mediation and Adaptation to Reciprocal Loyalty Arrangements
This study assesses the industrial relations application of the “loyalty-exit-voice” proposition. The loyalty concept is linked to reciprocal employer-employee arrangements and examined as a job attribute in a vignette questionnaire distributed to low and medium-skilled employees. The responses provided by employees in three European countries indicate that reciprocal loyalty arrangements, which involve the exchange of higher effort for job security, are one of the most desirable job attributes. This attribute exerts a higher impact on the job evaluations provided by unionised workers, compared to their non-union counterparts. This pattern is robust to a number of methodological considerations. It appears to be an outcome of adaptation to union mediated cooperation. Overall the evidence suggests that the loyalty-job evaluation profiles of unionised workers are receptive to repeated interaction and negative shocks, such as unemployment experience. This is not the case for the non-union workers. Finally, unionised workers appear to “voice” a lower job satisfaction, but exhibit low “exit” intentions, compared to the non-unionised labour.EPICURUS, a project supported by the European Commission through the 5th Framework Programme “Improving Human Potential” (contract number: HPSE-CT-2002-00143
Fair Division
Book review of Hervé Moulin\u27s Cooperative Microeconomics: A Game-Theoretic Introduction and H. Peyton Young\u27s Equity: In Theory and Practic
From Group Recommendations to Group Formation
There has been significant recent interest in the area of group
recommendations, where, given groups of users of a recommender system, one
wants to recommend top-k items to a group that maximize the satisfaction of the
group members, according to a chosen semantics of group satisfaction. Examples
semantics of satisfaction of a recommended itemset to a group include the
so-called least misery (LM) and aggregate voting (AV). We consider the
complementary problem of how to form groups such that the users in the formed
groups are most satisfied with the suggested top-k recommendations. We assume
that the recommendations will be generated according to one of the two group
recommendation semantics - LM or AV. Rather than assuming groups are given, or
rely on ad hoc group formation dynamics, our framework allows a strategic
approach for forming groups of users in order to maximize satisfaction. We show
that the problem is NP-hard to solve optimally under both semantics.
Furthermore, we develop two efficient algorithms for group formation under LM
and show that they achieve bounded absolute error. We develop efficient
heuristic algorithms for group formation under AV. We validate our results and
demonstrate the scalability and effectiveness of our group formation algorithms
on two large real data sets.Comment: 14 pages, 22 figure
- …