This paper studies the structure of qualitative capacities, that is, monotonic set-functions, when they range on a finite totally ordered scale equipped with an order-reversing map. These set-functions correspond to general representations of uncertainty, as well as importance levels of groups of criteria in multicriteria decision-making. More specifically, we investigate the question whether t...

From a physiological standpoint, the lung volumes are either dynamic or static. Both subclasses are measured at different degrees of inspiration or expiration; however, dynamic lung volumes are characteristically dependent on the rate of air flow. The static lung volumes/capacities are further subdivided into four standard volumes (tidal, inspiratory reserve, expiratory reserve, and residual vo...

We propose a generalization of capacities which encompass in a large extent the class of Choquet’s capacities. Then, we define the class of probabilistic values over these capacities, which are values satisfying classical axioms, the well-known Shapley value being one. Lastly, we propose a value on these capacities by borrowing ideas from electric networks theory.

In many production systems, capacities depend not only on machine capacities, but also on the available work-force levels in each period of the planning horizon. Therefore, these capacities are given in terms of labor hours. In order to develop aggregate plans, work-force levels should be established "rst, and then translated into available regular-time and overtime production capacities. In th...

We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for these games. In addition, we prove that an instance has a balanced solution if and only if it has a stable one. Our methods use a new idea of reducing an in...

For any non-compact Riemannian manifold M of dimension n ≥ 2 we previously defined a function λM : M×M → R+ = R+∪{+∞] only dependent on the conformal structure of M , and proved that for a class of manifolds containing all the proper subdomains of R, λ 1 n M was a distance on M [F1, F2]. The case of a domain G of R has been the object of several investigations leading to estimations of λG[V1, ....

Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like calculus with bounded capacities and weighed processes, where migration and activation require space. A type system complements the dynamics of the calculus by providing static guarantees...

We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. ...

Symplectic capacities were introduced in 1990 by I. Ekeland and H. Hofer [19, 20] (although the first capacity was in fact constructed by M. Gromov [40]). Since then, lots of new capacities have been defined [16, 30, 32, 44, 49, 59, 60, 90, 99] and they were further studied in [1, 2, 8, 9, 17, 26, 21, 28, 31, 35, 37, 38, 41, 42, 43, 46, 48, 50, 52, 56, 57, 58, 61, 62, 63, 64, 65, 66, 68, 74, 75...