Video taped group decision experiments on a two-person investment game were used to elicit the motivational structure of subjects' behavior. A majority of investors trusted (invested) and a majority of receivers reciprocated (returned). Cognition and decision were focused on extremes: total or...

In mechanism design problems under incomplete information, it is generally difficult to find decision problems that are first best implementable. A decision problem under incomplete information is first best implementable if there exists a mechanism that extracts the private information and...

In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that...

Adaptive learning and punishment are highly prominent competing explanations for ultimatum game behavior. We report on an experiment that considers each theory in stand-alone form, so that one does not rely on the other in any substantial way. Our data exhibits patterns for which punishment can...

In this paper we analyze sequencing situations under incomplete information where agents have interdependent costs. We first argue why Vickrey-Clarke-Groves (or VCG) mechanism fails to implement a simple sequencing problem in dominant strategies. Given this impossibility, we try to implement...

Second price allpay auctions (wars of attritions) have an evolutionarily stable equilibrium in pure strategies if valuations are private information. I show that for any level of uncertainty there exists a pure deviation strategy close to the equilibrium strategy such that for some valuations...

We provide an evolutionary foundation to evidence that in some situations humans maintain optimistic or pessimistic attitudes towards uncertainty and are ignorant to relevant aspects of the environment. Players in strategic games face Knightian uncertainty about opponents' actions and maximize...

We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or generalized fictitious play learning scheme, then for sufficiently large...