There has been considerable research in the framework of so-called 'generalized probability theories' or 'Boxworld' on the problem of what information-theoretic constraints in the class of 'no signaling' theories would characterize quantum theories.
The aim is to characterise the attitudes of agents who are practically rational, and various (static and sequential) arguments are typically made to show that certain practical catastrophes befall agents who do not satisfy standard decision-theoretic constraints.
In this paper, we study a graph-theoretic problem that aims to simultaneously address a network design task and a location-theoretic constraint.
The optimization is carried out via a game theoretic approach under assigned system constraints on the overall streaming rate and the maximum random access delay.
We propose a game theoretic model with a coupled constraints equilibrium as a solution to the regulator's problem of avoiding excessive pollution.
Requiring that fitness in cultural evolutionary game theoretic models conform to this interpretative constraint severely limits the kinds of problems that one can address.
The motion vector fields and the disparity vector fields are therefore simultaneously derived using the stereo-motion consistency constraint in a set theoretic convex optimization framework.
In this study, we modify this approach such that it can handle the average transmit power constraints under which the information theoretic capacity bounds (cut-set bound and achievable DF rate) we are interested in here were derived.
8. See de Swart 2011 for a comprehensive study of the cross-linguistic semantics of negation within a bidirectional optimality-theoretic framework in which syntactic and semantic constraints act in concert to define the grammar of a language.
