In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...

We consider the n-player houseswapping game of Shapley-Scarf (1974), with indfferences in preferences allowed. It is well-known that the strict core of such a game may be empty, single-valued, or multi-valued. We define a condition on such games called "segmentability", which means that the set...

Conventional data envelopment analysis (DEA) for measuring the relative efficiency of a set of decision-making units (DMUs) requires the observations to have precise values. When observations are imprecise and represented by interval values, the efficiencies are also expected to reflect interval...

In this note we present as well necessary as sufficient conditions for existence of a Pareto optimum for general non-convex differential games. The obtained results are used to analyze the non-convex regular indefinite linear quadratic differential game. For the scalar case an algorithm is...

In this article we derive necessary and sufficient conditions for the existence of Pareto optimal solutions for an N player cooperative infinite horizon differential game. Firstly, we write the problem of finding Pareto candidates as solving N constrained optimal control subproblems. We derive...