We propose an extension of the auction model with many divisible commodities for vector price (validity) functions. It can be viewed as a new general equilibrium model for complex systems with active elements. We give its sufficient vector variational inequality formulation and new general...

We study all-pay auctions (or wars of attrition), where the highest bidder wins an object, but all bidders pay their bids. We consider such auctions when two bidders alternate in raising their bids and where all aspects of the auction are common knowledge including bidders' valuations. We...

We study equilibria in second price auctions when bidders are independently and privately informed about both their values and participation costs and their joint distributions across bidders are not necessarily identical. We show that there always exists an equilibrium in this general setting...

Affiliation has been a prominent assumption in the study of economic models with statistical dependence. Despite its large number of applications, especially in auction theory, affiliation has limitations that are important to be aware of. This paper shows that affiliation is a restrictive...

We consider a procurement auction, where each supplier has private costs and submits a stepped supply function. We solve for a Bayesian Nash equilibrium and show that the equilibrium has a price instability in the sense that a minor change in a supplier.s cost sometimes result in a major change...

Discontinuous games, such as auctions, may require special tie-breaking rules to guarantee equilibrium existence. The best results available ensure equilibrium existence only in mixed strategy with endogenously defined tie-breaking rules and communication of private information. We show that an...

This is a corrigendum to Theorem 15 of Jackson and Swinkels (2005) [Existence of Equilibrium in Single and Double Private Value Auctions, Econometrica, 73, 93-140], which proves the existence of equilibrium with positive probability of trade for private value auctions

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

We consider a procurement auction, where each supplier has private costs and submits a stepped supply function. We solve for a Bayesian Nash equilibrium and show that the equilibrium has a price instability in the sense that a minor change in a supplier's cost sometimes result in a major change...

We aim at characterizing which kind of functions could be explained (rationalized) as the best reply of payoff-maximizing agents in contests for a fixed prize. We show that the rationalizability strongly differs between Decisive Contests, where the prize is allocated with certainty, and Possibly...