We introduce and study a network resource management problem that is a special case of nonmetric k-median, naturally arising in cross platform scheduling and cloud computing. In the continuous d-dimensional container selection problem, we are given a set C ⊂ R of input points, for some d ≥ 2, and a budget k. An input point p can be assigned to a “container point” c only if c dominates p in ever...

Abstract In this article, we introduce the Maximum Diversity Assortment Selection Problem (MDASP), which is a generalization of two-dimensional Knapsack (2D-KP). Given set rectangles and rectangular container, goal 2D-KP to determine subset that can be placed in container without overlapping, i.e., feasible assortment, such maximum area covered. MDASP assortments, each them covering certain min...

Manipulation tasks are sequential in nature. Grasp selection approaches that take into account the constraints at each task step are critical, since they allow to both (1) Identify grasps that likely require simple arm motions through the whole task and (2) To discard grasps that, although feasible to achieve at earlier steps, might not be executable at later stages due to goal task constraints...

A principal’s attention is repeatedly sought by multiple agents, each eager for his ideas to be implemented. An idea’s quality stochastically affects the principal’s profit, and agents’ abilities to generate good ideas may be private information. The principal is unable to review proposals before choosing one each period. She can provide incentives only through her selection rule among proposal...

................................................................................................................... iii Author ...................................................................................................................... iii Acknowledgements .................................................................................................. iii Disclaimer ...................

We consider a setting where we have to organize one or several group activities for a group of agents. Each agent will participate in at most one activity; her preference over activities generally depends on the number of participants in the activity. The goal is to assign agents to activities in a desirable way. We give a general model, which is a natural generalization of anonymous hedonic ga...