Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments for them, and prove counterparts of de Finetti’s finite and infinite representation theorems. We show that the finite representation in terms of count vector...

We propose seven desirable properties for artificial learning systems, namely: incrementality, nonmonotonicity, inconsistency and conflicting defaults handling, abstraction, self-organization, generalization, and computational tractability. This proposed set of properties is not claimed to be complete, nor does it imply that all properties must necessarily be present in all learning models. Rat...

When modelling travel times and traffic flows varying over time on traffic networks it is desirable that the travel times should satisfy certain properties. This paper investigates these properties and their interrelationships, in particular, uniqueness and continuity, first-in-first-out (FIFO), causality and time-flow consistency, while assuming a single traffic type. For generality we investi...