Assignment problem

About: Assignment problem is a research topic. Over the lifetime, 7588 publications have been published within this topic receiving 172820 citations. The topic is also known as: marriage problem.

Coverage Optimization with a Dynamic Network of Drone Relays

Abstract: The integration of aerial base stations carried by drones in cellular networks offers promising opportunities to enhance the connectivity enjoyed by ground users In this paper, we propose an optimization framework for the 3–D placement and repositioning of a fleet of drones with a realistic inter-drone interference model and drone connectivity constraints We show how to maximize network coverage by means of an extremal-optimization algorithm The design of our algorithm is based on a mixed-integer non-convex program formulation for a coverage problem that is NP-Complete, as we prove in the paper We not only optimize drone positions in a 3–D space in polynomial time, but also assign flight routes solving an assignment problem and using a strong geometrical tool, namely Bezier curves , which are extremely useful for non-uniform and realistic topologies Specifically, we propose to fly drones following Bezier curves to seek the chance of approaching to clusters of ground users This enhances coverage over time while users and drones move We assess the performance of our proposal for synthetic scenarios as well as realistic maps extracted from the topology of a capital city We demonstrate that our framework is near-optimal and using Bezier curves increases coverage up to 47 percent while drones move

A Survey on Reviewer Assignment Problem

Abstract: Research into Reviewer Assignment Problem (RAP) is still in its early stage but there is great world-wide interest, as the foregoing process of peer-review which is the brickwork of science authentication. The RAP approach can be divided into three phases: identifying assignment procedure, computing the matching degree between manuscripts and reviewers, and optimizing the assignment so as to achieve the given objectives. Methodologies for addressing the above three phases have been developed from a variety of research disciplines, including information retrieval, artificial intelligent, operations research, etc. This survey is not only to cover variations of RAP that have appeared in the literature, but also to identify the practical challenge and current progress for developing intelligent RAP systems.

Infinite order Lorenz dominance for fair multiagent optimization

Abstract: This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a fair compromise solution between individual point of views. Lorenz dominance is a standard decision model used in Economics to refine Pareto dominance while favoring solutions that fairly share happiness among agents. In order to enhance the discrimination possibilities offered by Lorenz dominance, we introduce here a new model called infinite order Lorenz dominance. We establish a representation result for this model using an ordered weighted average with decreasing weights. Hence we exhibit some properties of infinite order Lorenz dominance that explain how fairness is achieved in the aggregation of individual preferences. Then we explain how to solve fair assignment problems of m items to n agents, using infinite order Lorenz dominance and other models used for measuring inequalities. We show that this problem can be reformulated as a 0--1 non-linear optimization problems that can be solved, after a linearization step, by standard LP solvers. We provide numerical results showing the efficiency of the proposed approach on various instances of the paper assignment problem.