The satisficing approach is generalized and applied to finite n-person games. Based on direct elicitation of aspirations, we formally define the concept of satisficing, which does not exclude (prior-free) optimality but includes it as a border case. We also review some experiments on strategic...

On a heterogeneous experimental oligopoly market, sellers choose a price, specify a set-valued prior-free conjecture about the others' behavior, and form their own profit-aspiration for each element of their conjecture. We formally define the concepts of satisficing and prior-free optimality and...

In this paper, we reexamine Eliaz's results (2002) of fault tolerant implementation on one hand and we extend theorems 1 and 2 of Doghmi and Ziad (2008a) to bounded rationality environments, on the other. We identify weak versions of the k-no veto power condition, in conjunction with unanimity...

In this paper we offer a new approach to modeling strategies of bounded complexity, the so-called factor-based strategies. In our model, the strategy of a player in the multi-stage game does not directly map the set of histories to the set of her actions. Instead, the player's perception of is...