We introduce a notion of coarse competitive equilibrium, to study agents’ inability to tailor their consumption to prices. Our goal is to incorporate limited cognitive ability (in particular limited attention, memory and complexity) into the analysis of competitive equilibrium. Compared to standard competitive equilibrium, our concept yields more extreme prices and, when all agents have the sam...

The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of symmetries in practice. Although value precedence can be expressed straightforwardly using if-then constraints in existing constraint programming systems, the resulting formulation is inefficient both in terms of size...

in this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. this study seems utterly new and it is applicable to any performance measure based on the completion time. the in...

the study investigated the constraints to farmers’ intention to pay for private irrigation in nandom district, ghana. using a key informant interviews and semi-structured questionnaires, the study collected data from 236 farmers. data was analyzed with descriptive and inferential statistics. kendall coefficient of concordance was used to determine the level of agreement among farmers in ranking...

This paper deals with the problem of forbidden states in discrete event systems modeled by Petri Net. To avoid the forbidden states, some constraints which are called Generalized Mutual Exclusion Constraints can be assigned to them. Enforcing these constraints on the system can be performed using control places. However, when the number of these constraints is large, a large number of control p...

Characters, like other articulated objects and structures, are typically simulated using articulated dynamics algorithms. There are efficient linear-time algorithms for the simulation of open-chain articulated bodies, but complexity grows notably under additional constraints such as joint limits, loops or contact, or if the bodies undergo stiff joint forces. This paper presents a linear-time al...

Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutions, then searching for solutions that satisfy the constraints. Experts often augment models with implied constraints and constraints that break symmetries in the model. An emerging pattern in the modelling process, highl...

We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simultaneously on variables and values, conditional symmetries, as well as symmeties acting on set and other types of variables.

In this paper we consider a vector-valued Allen-Cahn MPEC problem. To derive optimality conditions we exploit a regularization-relaxation technique. The optimality system of the regularized-relaxed subproblems are investigated by applying the classical result of Zowe and Kurcyusz. Finally we show that the stationary points of the regularizedrelaxed subproblems converge to weak stationary points...