This paper considers the task reallocation problem, where agents are to be extracted from a coordinated group of agents in order to perform a new task. The interaction between the team members and the cost associated with this interaction are represented by a weighted graph. Consider a group of robots organized in a formation, the graph is the monitoring graph which represents the sensorial cap...

Reallocating resources to get mutually beneficial outcomes is a fundamental problem in various multi-agent settings. In the first part of the paper we focus on the setting in which agents express additive cardinal utilities over objects. We present computational hardness results as well as polynomial-time algorithms for testing Pareto optimality under different restrictions such as two utility ...

Resource reallocationproblems aim todetermine an allocationmaximizing a given objective function. Numerous applications are based on the assumption of restricted contacts between entities but, up to now, studies have been based on unrealistic contexts. Indeed, most of the time, agents are omniscient and/or have complete communication abilities, which are not plausible assumptions in many applic...

This paper explains exchange rate dynamics by linking …nancial customers’foreign exchange order ‡ow with their dynamic portfolio reallocation. For any currency pair in a particular period, one currency has higher assets return than the other and can be considered the high-return-currency (HRC). Financial institutions attempt to hold more HRC assets when they become more risk-loving or the relat...

This paper considers the task reallocation problem, where k robots are to be extracted from a coordinated group of N robots in order to perform a new task. The interaction between the team members and the cost associated with this interaction are represented by a directed weighted graph. Consider a group of N robots organized in a formation. The graph is the monitoring graph which represents th...

Access control, as part of every software system, has evolved as computing has evolved. Its original aim was to limit unauthorized access to centralized systems, but the rise of social networks like Facebook has changed that. Now each person wants to control who sees photos or makes comments on their local wall by making and unmaking friends, i.e. dynamic, distributed rights control. Social net...

We analyze how regulatory constraints on household leverage—in the form of loan-to-income and loan-to-value limits—affect residential mortgage credit house prices as well other asset classes not directly targeted by limits. Loan-level data suggest that is reallocated from low- to high-income borrowers urban rural counties. This reallocation weakens feedback between slows price growth in “hot” h...

The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in which pickups and deliveries must be performed in two independent networks. The items are stored in stacks and repacking is not allowed. Given a pickup and a delivery tour, the problem of checking if there exists a valid distribution of items into s stacks of size h that is consistent with the given tours...

Conventional and new sintering mechanisms have been porous compacts is well-known in the ceramic literature. However, several reports have been presented recently that investigated using fine powders of CeO2 and Y2O3 of excellent sinterability. We have verified the validity of Herring’s show that particle/grain size can remain essentially constant up to a density of 92%, and such a resistance t...

Three policies, namely Optimal Repacking, Least Load Routing, and Bernoulli Splitting, are considered for dynamic resource allocation in load sharing networks with standard Erlang type statistics. Large deviations principles are established for the three policies in a simple network of three consumer types and two resource locations, and are used to identify the network overrow exponents. The o...