Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2  functions. The class of prox-regular functions covers all convex functions, lower C2  functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...

In many applications, the reliability relation associated with available information is only partially defined, while most of existing uncertainty frameworks deal with totally ordered pieces of knowledge. Partial pre-orders offer more flexibility than total pre-orders to represent incomplete knowledge. Possibilistic logic, which is an extension of classical logic, deals with totally ordered inf...

In the quest to better understand the connection between median graphs, triangle-free graphs and partial cubes, a hierarchy of subclasses of partial cubes has been introduced. In this article, we study the role of tiled partial cubes in this scheme. For instance, we prove that

Belief revision studies strategies about how agents revise their belief states when receiving new evidence. Both in classical belief revision and in epistemic revision, a new input is either in the form of a (weighted) propositional formula or a total pre-order (where the total pre-order is considered as a whole). However, in some real-world applications, a new input can be a partial pre-order ...

We address the question of whether unbarred market entry can eliminate monopolizing behavior in the presence of acquisitions. We model this question by using a four-stage repeated noncooperative game. Analysis of subgame perfect pure strategy Nash equilibria of this game under simplifying assumptions …nds that even with entry and the absence of collusion, competitive acquisition of …rms by thei...

A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a definability property of the class of partial orders in monadic second-order logic. Based on a non-definability result for a class of partial orders, an exampl...

Conditions of information independence are important in information economics and game theory. We present notions of partial independence in Bayesian environments, and study their relationships to notions of common knowledge.

This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...

We strive to overcome impunity for international crimes and serious violations of human rights. Our reasons may include a vision of justice and perhaps a hope for deterrence. Notwithstanding our aspiration to establish a regime of accountability, impunity remains a recurrent pattern. Where an effort at accountability is undertaken at all, it consistently is approached through a second-best alte...

Type-directed partial evaluation is a new approach to program specialization for functional programming languages. Its merits with respect to the traditional offline partial evaluation approach have not yet been fully explored. We present a comparison of type-directed partial evaluation with standard offline partial evaluation in both a qualitative and quantitative way. For the latter we use im...