In this paper we present a new iterative auction, the bisection auction, that can be used for the sale of a single indivisable object. We will show that the bisection auction is computationally more efficient than the classical English auction while it still preserves all characteristics the...

In a laboratory experiment, we investigate the impact of temporary buy-options on efficiency, revenues, and bidding behavior in online proxy-auctions when bidders have independent private valuations. We show that the introduction of a buy-option reduces efficiency and at the same time fails to...

The goal of this paper is twofold. Firstly a short proof of the unicity of the reduced form of a normal form game is provided, using a technique to reduce a game originally introduced by Mertens. Secondly a direct combinatorial-geometric interpretation of the reduced form is described. This...

The VCG mechanism has some nice properties if the agents-are-substitutes property holds.For example, for combinatorial auctions the property assures that the VCG mechanism is supported by a pricing equilibrium. The existence of such a pricing equilibrium is a necessary condition for the...

Two-person noncooperative games with finitely many pure strategies and ordinal preferences over pure outcomes are considered, in which probability distributions resulting from mixed strategies are evaluated according to t-degree stochastic dominance. A t-best reply is a strategy that induces a...

In this paper we present a generalization of the Shapley-Ichiishi result for convex games to the class of all exact games. Then we discuss two applications to the class of convex games. First we show that it can indeed be used to give an alternative proof of the Shapley-Ichiishi result. Secondly...

In this paper it is shown how to compute stable sets, defined by Mertens (1989), inthe context of bimatrix games only using linear optimization techniques.

In this paper we apply the concept of preference conjecture equilibrium introduced in Perea (2003) to signaling games and show its relation to sequential equilibrium. Furthermore, we introduce the concept of minimum revision equilibrium and show how this can be interpreted as a refinement of...

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

In this paper we analyze the performance of a recently proposed sequential auction, called the c-bisection auction, that can be used for a sale of a single indivisible object. We discuss the running time and the e±ciency in the ex-post equilibrium of the auction. We show that by changing the...