Procedural Mixture Spaces

This paper provides a representation theorem for procedural mixture spaces. Procedural mixture spaces are mixture spaces in which it is not necessarily true that a mixture of two identical elements yields the same element. Under the remaining standard assumptions of mixture spaces, the following representation theorem is proven; a rational, independent, and continuous preference relation over mixture spaces can be represented either by expected utility plus the Shannon entropy or by expected utility under probability distortions plus the Renyi entropy. The entropy components can be interpreted as the utility or disutility from resolving the mixture and therefore as a procedural as opposed to consequentialist value.