Related papers: Sorting with Teams
We present a coordination method for multiple mobile manipulators to sort objects in clutter. We consider the object rearrangement problem in which the objects must be sorted into different groups in a particular order. In clutter, the…
Assignment games represent a tractable yet versatile model of two-sided markets with transfers. We study the likely properties of the core of randomly generated assignment games. If the joint productivities of every firm and worker are…
Wage dispersion and job-to-job mobility are central features of modern labour markets, yet canonical equilibrium search models with exogenous job-offer ladders struggle to jointly account for these facts and the magnitude of frictional wage…
In this paper we present efficient algorithmic solutions for several constrained resource allocation, management and discovery problems. We consider new types of resource allocation models and constraints, and we present new geometric…
Why is the U.S. industry-level productivity dispersion countercyclical? Theoretically, we build a duopoly model in which heterogeneous R&D costs determine firms' optimal behaviors and the equilibrium technology gap after a negative profit…
This paper characterizes optimal classification when individuals adjust their behavior in response to the classification rule. We model the interaction between a designer and a population as a Stackelberg game: the designer selects a…
Consider a dynamic task allocation problem, where tasks are unknowingly distributed over an environment. This paper considers each task comprised of two sequential subtasks: detection and completion, where each subtask can only be carried…
Numerous algorithms have been produced for the fundamental problem of clustering under many different notions of fairness. Perhaps the most common family of notions currently studied is group fairness, in which proportional group…
We consider an assortment optimization problem where a customer chooses a single item from a sequence of sets shown to her, while limited inventories constrain the items offered to customers over time. In the special case where all of the…
We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…
The assignment of personnel to teams is a fundamental and ubiquitous managerial function, typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the…
The classical comparison-based sorting problem asks us to find the underlying total order of a given set of elements, where we can only access the elements via comparisons. In this paper, we study a restricted version, where, as a hint, a…
Effectively rearranging heterogeneous objects constitutes a high-utility skill that an intelligent robot should master. Whereas significant work has been devoted to the grasp synthesis of heterogeneous objects, little attention has been…
We study competition between firms in labor markets, following a combinatorial model suggested by Kelso and Crawford [1982]. In this model, each firm is trying to recruit workers by offering a higher salary than its competitors, and its…
In this paper we study the problem of allocating a scarce resource among several players (or agents). A central decision maker wants to maximize the total utility of all agents. However, such a solution may be unfair for one or more agents…
Real-life tools for decision-making in many critical domains are based on ranking results. With the increasing awareness of algorithmic fairness, recent works have presented measures for fairness in ranking. Many of those definitions…
Distributed optimization for resource allocation problems is investigated and a sub-optimal continuous-time algorithm is proposed. Our algorithm has lower order dynamics than others to reduce burdens of computation and communication, and is…
This paper studies the topic of cost-efficiency in incomplete markets. A payoff is called cost-efficient if it achieves a given probability distribution at some given investment horizon with a minimum initial budget. Extensive literature…
In risk-sharing markets with aggregate uncertainty, characterizing Pareto-optimal allocations when agents might not be risk averse is a challenging task, and the literature has only provided limited explicit results thus far. In particular,…
We address the problem of sharing risk among agents with preferences modelled by a general class of comonotonic additive and law-based functionals that need not be either monotone or convex. Such functionals are called distortion…