We investigate the relations between different types of perfect equilibrium, introduced by Simon and Stinchcombe (1995) for games with compact action spaces and continuous payoffs. Simon and Stinchcombe distinguish two approaches to perfect equilibrium in this context, the classical "trembling...

The class of bargaining solutions that are defined on the domain of finite sets of alternatives and satisfy Weak Pareto Optimality (WPO), Independence of Irrelevant Alternatives (IIA) and Covariance (COV), is characterized. These solutions select from the set of maximizers of a nonsymmetric Nash...

Incomplete preferences over lotteries on a ¯nite set of alternatives satisfying, besides independence and continuity, a property called bad outcome aversion are considered. These preferences are characterized in terms of their speci¯c multi-expected utility representations (cf. Dubra et al.,...

We analyze whether noncooperative collusive equilibria are harder to sustain when individual demand levels are not fixed but are able to fluctuate. To do this, we extend a Bertrand type model of price competition to allow for fluctuating market shares when prices are equal. We find that, the...

Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of...

We investigate the relations between different types of perfect equilibrium, introduced by Simon and Stinchcombe (1995) for games with compact action spaces and continuous payoffs. Simon and Stinchcombe distinguish two approaches to perfect equilibrium in this context, the classical "trembling...

We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running timeof the auction is infinite for almost all realizations of valuations of the bidders. We also show that this result...

Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of...