In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to the target, or a winner can be a player coming closest without guessing higher than the target. We study optimal strategies for players in these games and d...

The present research investigated the influence ot multiple sequential primes on social categorization processes. Study 1 examined an evaluative decision task in which targets were preceded and succeeded by two primes. As expected, the temporally closest forward primes had assimilative effects on target processing. Moreover, if the temporally closest forward prime and the target were congruent,...

In this paper we propose numerical algorithms for solving large-scale quadratic eigenvalue problems for which a set of eigenvalues closest to a fixed target and the associated eigenvectors are of interest. The desired eigenvalues are usually with smallest modulo in the spectrum. The algorithm based on the quadratic Jacobi-Davidson (QJD) algorithm is proposed to find the first smallest eigenvalu...

Basic models of Data Envelopment Analysis are intrinsically preference-free, in the sense that they consider all inputs and outputs and also all decision making units of the same importance. Although this property is beneficial in many ways, it has some drawbacks simultaneously, as the decision makers’ preferences are not taken into account in the process of evaluating units.  To overcome this ...

Inverse optimization is the problem of determining values missing input parameters for an associated forward that are closest to given estimates and will make a target vec...