The theory of melioration, originally formulated for individual decision-making contexts, is formally extended to a game theoretic framework. This paper proves the existence of a distribution that is a melioration strategy on the part of all players. Further, the question of stability of such a...

This paper considers characterizations of perfect recall in extensive form games. It is shown that perfect recall can be expressed entirely in terms of the choice partition without any reference to any information sets. When information sets are taken into account it is decomposable into an...

We report results of experiments designed to test the predictions of the best reply process. In a Cournot oligopoly with four firms, the best reply process should theoretically explode if demand and cost functions are linear. We find, however, no experimental evidence of such instability....

Participants of dynamic competition games may prefer to play with the rules of the game by systematically withholding e¤ort in the beginning. Such behavior is referred to as sandbagging. I consider a two-period con- test between heterogeneous players and analyze potential sandbagging of...

This paper introduces a two-sided methodological framework for   studies on cooperation based on a new game design. Presented games are continuous prisoner's   dilemma games with positive and negative presentations of an identically structured   decision problem. Decision makers can choose an...

In order to deliver an innovation principals employ competing agents in some circumstances, while employing research team in other circumstances. This paper compares various structures of R&D to provide a rational behind this observation. It is assumed, that the principal can employ either one...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

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...

Consider a large population of individuals that are repeatedly randomly matched to play a cyclic 2x2 game such as Matching Pennies with fixed roles assigned in the game. Some learn by sampling previous play of a finite number of other individuals in the same role. We analyze population dynamics...