Uniqueness of stationary equilibrium payoffs in coalitional bargaining

We study a model of sequential bargaining in which, in each period before an agreement is reached, the proposer?s identity is randomly determined, the proposer suggests a division of a pie of size one, each other agent either approves or rejects the proposal, and the proposal is implemented if the set of approving agents is a winning coalition for the proposer. The theory of the fixed point index is used to show that stationary equilibrium expected payoffs of this coalitional bargaining game are unique. This generalizes Eraslan [34] insofar as: (a) there are no restrictions on the structure of sets of winning coalitions; (b) different proposers may have different sets of winning coalitions; (c) there may be a positive probability that no proposer is selected.     

Invariance of conditional maximum utility

The consumer benefit in a discrete choice model is often measured by maximum utility. We characterize the conditional (on the chosen alternative) and the unconditional distribution of maximum utility. We show that among a wide class of distributions (independent with convex supports) of error terms, the Type I extreme-value distribution is the unique distribution which ensures that all the conditional distributions of maximum utility coincide. Moreover, we show that for i.i.d. (with convex support) error terms, the invariance of conditional expected maximum utility characterizes the multinomial logit model.     

Sequential auctions with randomly arriving buyers

We analyze a dynamic market in which buyers compete in a sequence of private-value auctions for differentiated goods. New buyers and new objects may arrive at random times. Since objects are imperfect substitutes, buyers? values are not persistent. Instead, each buyer?s private value for a new object is a new independent draw from the same distribution.We consider the use of second-price auctions for selling these objects, and show that there exists a unique symmetric Markov equilibrium in this market. In equilibrium, buyers shade their bids down by their continuation value, which is the (endogenous) option value of participating in future auctions. We characterize this option value and show that it depends not only on the number of buyers currently present on the market and the distribution of their values, but also on anticipated market dynamics.     

Signaling in a Rent‐Seeking Contest with One‐Sided Asymmetric Information

We consider a two‐player rent‐seeking Tullock contest where one player has private information about his valuation of the prize, which can be high or low. This player can send a costly signal to his opponent, i.e., he can commit to reduce the prize either by some absolute amount of money or proportionally, conditional on winning it. We show that both kinds of signaling imply completely opposite results for separating equilibria, both in terms of conditions for existence and the type of player who sends the costly signal.     

Best-of-three all-pay auctions

We study a best-of-three all-pay auction. It is shown that with values of winning and without values of losing, this auction is less productive (the players’ total expected effort is smaller) than the one-stage all-pay auction. However, with different values of losing over the contest’s stages it may be more productive than the one-stage all-pay auction.     

Search by committee

We consider the problem of sequential search when the decision to stop is made by a committee and show that a unique symmetric stationary equilibrium exists given a log concave distribution of rewards. We compare search by committee to the corresponding single-agent problem and show that committee members are less picky and more conservative than the single agent. We show how (i) increasing committee size holding the plurality fraction constant and (ii) increasing the plurality rule affect the equilibrium acceptance threshold and expected search duration. Finally, we show that unanimity is optimal if committee members are sufficiently patient.     

Sequential vs. single-round uniform-price auctions

We study sequential and single-round uniform-price auctions with affiliated values. We derive symmetric equilibrium for the auction in which k₁ objects are sold in the first round and k₂ in the second round, with and without revelation of the first-round winning bids. We demonstrate that auctioning objects in sequence generates a lowballing effect that reduces the first-round price. Total revenue is greater in a single-round, uniform auction for k=k₁+k₂ objects than in a sequential uniform auction with no bid announcement. When the first-round winning bids are announced, we also identify a positive informational effect on the second-round price. Total expected revenue in a sequential uniform auction with winning-bids announcement may be greater or smaller than in a single-round uniform auction, depending on the model's parameters.     

Investment timing and learning externalities

We study a duopoly model of investment, in which each player learns about the quality of a common value project by observing some public background information, and possibly the experience of his rival. Investment costs are private information, and the background signal takes the form of a Poisson process conditional on the quality of the project being low. The resulting attrition game has a unique, symmetric equilibrium, which depends on initial public beliefs. We determine the impact of changes in the cost and signal distributions on investment timing, and how equilibrium is affected when a first-mover advantage is introduced.     

Progressive taxation and corporate liquidation policies with mean-reverting earnings

This paper develops a real options model of an all-equity financed firm that receives mean-reverting earnings and is subject to progressive taxation. Tax progression arises from an exogenously given tax exemption threshold such that the firm pays no corporate income taxes should its earnings be less than this threshold. The firm possesses a perpetual option to liquidate its operation for a deterministic salvage value at any time. We show that the firm optimally exercises the liquidation option at the first instant when its earnings reach an endogenously determined threshold (the liquidation trigger) from above. Using numerical analysis, we show that the liquidation trigger is higher or lower than the exogenously given tax exemption threshold, depending on whether the tax exemption is below or above a unique critical level, respectively. We further show that the liquidation trigger is strictly decreasing for all tax exemption thresholds less than the critical level, and can be hump-shaped for all tax exemption thresholds greater than the critical level, especially when the salvage value is small. Corporate income taxes as such are not neutral when tax schedules are progressive.     

Destruction and settlement norms as determinants of conflict: An evolutionary perspective

This paper studies conflict in a simple bargaining framework using an evolutionary game-theoretic approach. Our findings suggest that a player does not always regard the winning probability as an acceptable settlement rule. He accepts a division according to winning probability when the destruction caused to him in conflict is more than a threshold, which in turn depends on cost of conflict to the opponent and the size of the population. Further, our analysis shows that the norms with positive weight to disagreement payoff are effective against conflict, and incentivize peace. Contrary to the findings of extant studies carried out in finite population evolutionary game setting, the settlement possibility set is identical under both ESS and Nash equilibrium in our model with settlement norms.     

The number of pure Nash equilibria in a random game with nondecreasing best responses

We randomly draw a game from a distribution on the set of two-player games with a given size. We compute the distribution and the expectation of the number of pure-strategy Nash equilibria of the game conditional on the game having nondecreasing best-response functions. The conditional expected number of pure-strategy Nash equilibria becomes much larger than the unconditional expected number as the size of the game grows.     

Selection effects in auctions for monopoly rights

We demonstrate that auctioning market licenses may result in higher market prices than assigning them via more random allocation mechanisms. When future market profit is uncertain, winning an auction is like winning a lottery ticket. If firms differ in risk attitudes, auctions select the least risk-averse firm, which, in turn, set a higher price (or a higher quantity, in case quantity is the decision variable) in the marketplace than an average firm.     

Conditional versus unconditional bidding in takeovers

This paper explores the properties of multiple conditional takeover bids, and compares them with those of unconditional ones. If the initial takeover bid is unsuccessful, a raider is allowed to make a new tender offer to secure the required number of shares. Numerical analysis shows that the raider's expected profit from a conditional tender offer is higher than his expected profit from an unconditional bid, but still much lower than is predicted by static theories. However, the probability of a shareholder tendering his share is higher under the unconditional rather than conditional bidding. As the time between tender offers goes to zero, we show analytically that the expected profit from engaging in a conditional takeover bidding goes to zero similarly to the case of multiple unconditional offers.     

Bidding for the unemployed: An application of mechanism design to welfare-to-work programs

This paper applies the theory of mechanism design to welfare-to-work programs. When procuring welfare-to-work projects to employment service providers, governments face the problems of adverse selection (the winning provider is not the most efficient one) and moral hazard (the winning provider shirks in its responsibility to reintegrate unemployed people). We compare the constant-reward second-price auction with the socially optimal mechanism and show that the auction generates social welfare that is close to the optimal mechanism, while requiring less information and weaker commitment.     

Bidding behavior in competing auctions: Evidence from eBay

Much of the existing auction literature treats auctions as running independently of one another, with each bidder choosing to participate in only one auction. However, in many online auctions, a number of substitutable goods are auctioned concurrently and bidders can bid on several auctions at the same time. Recent theoretical research shows how bidders can gain from the existence of competing auctions, the current paper providing the first empirical evidence in support of competing auctions theory using online auctions data from eBay. Our results indicate that a significant proportion of bidders do bid across competing auctions and that bidders tend to submit bids on auctions with the lowest standing bid, as the theory predicts. The paper also shows that winning bidders who cross-bid pay lower prices on average than winning bidders who do not.     

Multidimensional mechanism design: Revenue maximization and the multiple-good monopoly

The seller of N distinct objects is uncertain about the buyer's valuation for those objects. The seller's problem, to maximize expected revenue, consists of maximizing a linear functional over a convex set of mechanisms. A solution to the seller's problem can always be found in an extreme point of the feasible set. We identify the relevant extreme points and faces of the feasible set. We provide a simple algebraic procedure to determine whether a mechanism is an extreme point. We characterize the mechanisms that maximize revenue for some well-behaved distribution of buyer's valuations.     

Beyond chopsticks: Symmetric equilibria in majority auction games

Majority auction games are simultaneous sealed-bid auctions of identical objects among identical bidders who each want to win a specified fraction (more than a half) of the objects. Each bidder receives no benefit from winning less than the specified fraction and no additional benefit from winning more than it. Symmetric equilibria having simple, intuitive forms are shown to exist in first-price, second-price and all-pay versions of such games when the number of bidders is sufficiently large. This contrasts with earlier results for the two-bidder “pure chopstick” majority auction games where the only known equilibria are more complicated.     

Efficient allocations under ambiguity

Important implications of the expected utility hypothesis and risk aversion are that if agents have the same probability belief, then consumption plans in every efficient allocation of resources under uncertainty are comonotone with the aggregate endowment, and if their beliefs are concordant, then the consumption plans are measurable with respect to the aggregate endowment. We study these two properties of efficient allocations for models of preferences that exhibit ambiguity aversion using the concept of conditional beliefs, which we introduce in this paper. We provide characterizations of such conditional beliefs for the standard models of preferences used in applications.     

An efficient solution to the informed principal problem

In this paper I study mechanism design by an informed principal. I show that generically this problem has an ex-post efficient solution. In the equilibrium mechanism, the informed principal appropriates all expected social surplus, with each type of her getting all expected social surplus conditional on that type. This outcome is supported as a perfect sequential equilibrium of the informed principal game when the joint probability distribution from which the agents’ types are drawn satisfies two conditions: the well-known condition of Cremer and McLean and Identifiability condition introduced by Kosenok and Severinov [Individually rational, budget-balanced mechanisms and allocation of surplus, J. Econ. Theory (2002), forthcoming]. Conversely, these conditions are necessary for an ex-post efficient outcome to be attainable in an equilibrium of the informed principal game. Under these conditions only our equilibrium outcome constitutes a neutral optimum, i.e. cannot be eliminated by any reasonable concept of blocking [R. Myerson, Mechanism design by an informed principal, Econometrica 51 (1983) 1767-1797]. Identifiability and Cremer-McLean conditions are generic when there are at least three agents, and none of them has more types than the number of type profiles of the other agents.     

Retailers and consumers in sequential auctions of collectibles

Abstract.  We analyse an independent private-value model, where heterogeneous bidders compete for objects sold in sequential second-price auctions. In this heterogeneous game, bidders may have differently distributed valuations, and some have multi-unit demand with decreasing marginal values (retailers); others have a specific single-unit demand (consumers). By examining equilibrium bidding strategies and price sequences, we show that the presence of consumers leads to more aggressive bidding from the retailers on average and heterogeneous bidders is a plausible explanation of the price decline effect. The study of the expected revenue of the seller confirms the interest of auctioneers in inviting different types of bidders.