One of the important issues in data envelopment analysis (DEA) is sensitivity analysis. Heretofore the existent studies have considered the data modification of inputs and outputs in one or multiple DMUs. In this paper the number of DMUs is increased and a stability region is obtained in  by applying defining hyperplanes in which if the added DMU (only one DMU) is in this region then all of the...

A parametric optimality principle (choice function) in a finite cooperative game of several persons is determined. This principle is specified by means of partition of players set into coalitions. It generates a set of generally efficient situations. Extreme cases of such a partition correspond to Pareto optimal situation and Nash equilibrium situation. For a situation, efficient for a given pa...

The purpose of this study is to utilize a new method for ranking extreme efficient decision making units (DMUs) based upon the omission of these efficient DMUs from reference set of inefficient and non-extreme efficient DMUs in data envelopment analysis (DEA) models with constant and variable returns to scale. In this method, an L2norm is used and it is believed that it doesn't have any existin...

This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating in dynamic environments with possible inter-task constraints. We present an approximate algorithm for task allocation in extreme teams, called eXtreme-Ants. The algorithm is inspired in the division of labor in social i...

We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner’s lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan’s lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and ...

Thi spaperdi scussesstochasti cextensi onsofasi mpl eprocessal gebrai nacausal i ty-based setti ng. Atomi c acti ons are supposed to happen after a del ay that i s deter-mi ned bya stochasti c vari abl e wi th acertai n di stri buti on. Asi mpl e stochasti c type of event structures i s di scussed, restri cti ng the di stri buti on functi ons to be expo-nenti al. Acorrespondi ngoperati onalsema...

Let {Xi},i = l, • • • , be a sequence of independent and identically distributed random variables with density function f(x). We shall assume throughout that EXi=p>0. Let {Sn}, n = l, • • • , be the sequence of cumulative sums Sn= 23"-1 -^«'Let H(x) = 23»= i P(Sn ^x) and h(x)=H'(x). Since H(x) is nondecreasing, h(x) is defined for almost all x. Let A be any Borel set of positive real numbers an...

We wish to navigate across complicated three-dimensional structures. We describe a robot that can propel itself on a web of surfaces oriented around arbitrary directions in three-space. This robot is an inchworm-like robot with a simple, modular, and exi-ble design. We present control algorithms for the task-level skills that allow the robot to walk vertically, horizontally , and inverted, and ...