An optimal repartitioning decision policy

A central problem to parallel processing is the determination of an effective partitioning of workload to processors. The effectiveness of any given partition is dependent on the stochastic nature of the workload. The problem of determining when and if the stochastic behavior of the workload has changed enough to warrant the calculation of a new partition is treated. The problem is modeled as a Markov decision process, and an optimal decision policy is derived. Quantification of this policy is usually intractable. A heuristic policy which performs nearly optimally is investigated empirically. The results suggest that the detection of change is the predominant issue in this problem

Optimal decision fusion and its application on 3D face recognition

Fusion is a popular practice to combine multiple classifiers or multiple modalities in biometrics. In this paper, optimal decision fusion (ODF) by AND rule and OR rule is presented. We show that the decision fusion can be done in an optimal way such that it always gives an improvement in terms of error rates over the classifiers that are fused. Both the optimal decision fusion theory and the experimental results on the FRGC 2D and 3D face data are given. Experiments show that the optimal decision fusion effectively combines the 2D texture and 3D shape information, and boosts the performance of the system

Optimal Hierarchies with Diverse Decision-Makers

We analyze the optimal decision-making hierarchy in an organization when decision-makers of limited liability have preferences conflicting with the organization's objective and exert externalities on their counterparts. In a horizontal hierarchy, every decision is made by a different agent. In a vertical hierarchy, one agent is in charge of all decisions. Only this agent is incentivized. This advantage is outweighed if there is a horizontal hierarchy so that the decision-makers' preferences are close to the organization's objective with respect to the decision they are in charge of but far from the organization's objective for the other decisions.

Task Release Control for Decision Making Queues

We consider the optimal duration allocation in a decision making queue. Decision making tasks arrive at a given rate to a human operator. The correctness of the decision made by human evolves as a sigmoidal function of the duration allocated to the task. Each task in the queue loses its value continuously. We elucidate on this trade-off and determine optimal policies for the human operator. We show the optimal policy requires the human to drop some tasks. We present a receding horizon optimization strategy, and compare it with the greedy policy.Comment: 8 pages, Submitted to American Controls Conference, San Francisco, CA, June 201