In this paper, I first prove an integral representation theorem: Every quasi-integral on a Stone lattice can be represented by a unique upper-continuous capacity. I then apply this representation theorem to study the topological structure of the space of all upper-continuous capacities on a...

We show that, in any undirected graph, splitting off can be performed while preserving all cuts of value at most 3/4 times the minimum value, and this is best possible. This generalizes a classical splitting-off result of Lovasz.

Parallel machine scheduling problems concern the scheduling of "n" jobs on "m" machines to minimize some function of the job completion time. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that...

We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times.

The critical role of free entry to correct inherent deviance behavior has been stressed by Vanek (1970), Meade (1972) amongst others. The equivalence theorem (Dreze 1976) defines that labour and entrepreneurial management both lead to the same Pareto optimal equilibrium provided that there is...

In this paper we present several "infeasible-start" path-following and potential-reduction primal-dual interior-point methods for non-linear conic problems. These methods try to find a recession direction of the feasible set of a self-dual homogeneous primal-dual problem.

In Van den Akker, Van Hoesel, and Savelsbergh (1994), we have studied a time-indexed formulation for single-machine scheduling problems and have presented a complete characterization of all facet inducing inequalities with right-hand side 1 and 2 for the convex hull of the monotone extension of...

If a solution (on a closed family of games) satisfies dummy axiom (DUM) and independance of irrelevant strategies (IIS) then it also satisfies consistency (CONS) (proposition 2.21, Peleg and Tijs, 1996). The converse of this proposition is not true: CONS implies neither DUM nor IIS as shown in...

In this paper I consider social choices under uncertainty. I prove that any social choice rule that satisfies independence of irrelevant alternatives, translation invariance, and weak anonymity is consistent with ex post Bayesian utilitarianism.