We establish existence of stochastic financial equilibria on filtered spaces more general than the ones generated by finite-dimensional Brownian motions. These equilibria are expressed in real terms and span complete markets or markets with withdrawal constraints. We deal with random endowment density streams which admit jumps and general time-dependent utility functions on which only regularit...

Stability results are given for a class of feedback systems arising from the regulation of time-varying discrete-time systems using optimal infinite-horizon and moving-horizon feedback laws. The class is characterized by joint constraints on the state and the control, a general nonlinear cost function and nonlinear equations of motion possessing two special properties. It is shown that weak con...

In this paper we address symmetry on combinatorial problems by following the approach of imposing additional symmetry-breaking constraints. Differently from other works in the literature, we attack the problem at the specification level. In fact, sometimes symmetries on specifications can be very easily detected, and symmetry-breaking formulae generated. We give formal definitions of symmetries...

Many constraint problems exhibit dominance relations which can be exploited for dramatic reductions in search space. Dominance relations are a generalization of symmetry and conditional symmetry. However, unlike symmetry breaking which is relatively well studied, dominance breaking techniques are not very well understood and are not commonly applied. In this paper, we present formal definitions...

The two major paradigms in the theoretical agency literature are moral hazard (i.e., hidden action) and adverse selection (i.e., hidden information). Prior research typically solves these problems in isolation, as opposed to simultaneously incorporating both adverse selection and moral hazard features. We formulate two complementary generalized principalagent models that incorporate features ob...

We discuss diierent methods of reducing symmetry in CSPs where the variables correspond to the cells of a matrix, and both the rows and the columns of the matrix are interchangeable. Two basic approaches are considered: adding symmetry-breaking constraints to the model, and breaking symmetry during search. We also show how the two approaches can be combined in this case. We empirically compare ...

In an auction market where the price of each selling item is restricted to an admissible interval (price rigidities), a Walrasian equilibrium usually fails to exist. Dreze (1975) introduced a variant concept of Walrasian equilibrium based on rationing systems, named constrained Walrasian equilibrium, for modelling an economy with price rigidities. Talman and Yang (2008) further refined the conc...

where x, c, c ∈ R1 , x, c, c ∈ R2 , b ∈ R, A1 is an m × n1 matrix, A2 is an m × n2 matrix, and T denotes the transposition. Such problems may arise when there are two decision makers at different hierarchical levels having joint constraints and different and possibly conflicting objectives. The decision-making process is sequential. The leader controlling the variables of x has the first choice...

Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of solution symmetries, and two different types of symmetry-breaking constraints to eliminate these symmetries at the modelling level. We discuss some preliminary computational results.

As experimentalists step up their pursuit of cold dark matter particles and neutrino masses, cosmological constraints are tightening. We compute the joint constraints on 11 cosmological parameters from cosmic microwave background and large scale structure data, and find that at 95% confidence, the total (cold+hot) dark matter density is hΩdm = 0.20 +.12 −.10 with at most 38% of it being hot (du...