Nonlinear pricing of storable goods

This paper develops a model of nonlinear pricing of storable goods. We show that storability imposes novel constraints on a monopolist’s ability to extract surplus. We then show that the attempt to relax these constraints can generate cyclical patterns in pricing and sales, even when consumers are homogeneous. Thus, the model provides a novel explanation for sales that does not rely on discrimination motives. Enriching the model to allow for buyer heterogeneity in storage technology, delivers the prediction that larger containers are more likely to be on sale. This prediction is consistent with observed patterns in scanner data

A Top Dog Tale with Preference Complementarities

The emergence of a winner-take-all (top dog) outcome is generally due to political or institutional constraints or to specific technological features which favour the performance of just one individual. In this paper we provide a different explanation for the occurrence of a top-dog equilibrium in exchange economies. We show that once heterogeneous complementarities (i.e. Scarf’s preferences) are analysed with general endowment distributions, a variety of equilibria different from the well-known symmetric outcome with full utilisation of resources can emerge. Specifically, we show that stable corner equilibria with a winner-take-all (top dog) individual arise that are Pareto optima although the remaining individuals are no better off than with zero consumption and resources can be unused. Because of heterogenous complementarities, market mechanisms are weak and cannot overcome the top dog’s power. Voting mechanisms or taxation policies can reduce the top dog’s privileged position

An Experimental Investigation of Colonel Blotto Games

"This article examines behavior in the two-player, constant-sum Colonel Blotto game with asymmetric resources in which players maximize the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a battlefield is deterministic, disadvantaged players use a 'guerilla warfare' strategy which stochastically allocates zero resources to a subset of battlefields. Advantaged players employ a 'stochastic complete coverage' strategy, allocating random, but positive, resource levels across the battlefields. In the lottery treatment, where winning a battlefield is probabilistic, both players divide their resources equally across all battlefields." (author's abstract)"Dieser Artikel untersucht das Verhalten von Individuen in einem 'constant-sum Colonel Blotto'-Spiel zwischen zwei Spielern, bei dem die Spieler mit unterschiedlichen Ressourcen ausgestattet sind und die erwartete Anzahl gewonnener Schlachtfelder maximieren. Die experimentellen Ergebnisse bestätigen alle wichtigen theoretischen Vorhersagen. Im Durchgang, in dem wie in einer Auktion der Sieg in einem Schlachtfeld deterministisch ist, wenden die Spieler, die sich im Nachteil befinden, eine 'Guerillataktik' an, und verteilen ihre Ressourcen stochastisch auf eine Teilmenge der Schlachtfelder. Spieler mit einem Vorteil verwenden eine Strategie der 'stochastischen vollständigen Abdeckung', indem sie zufällig eine positive Ressourcenmenge auf allen Schlachtfeldern positionieren. Im Durchgang, in dem sich der Gewinn eines Schlachtfeldes probabilistisch wie in einer Lotterie bestimmt, teilen beide Spieler ihre Ressourcen gleichmäßig auf alle Schlachtfelder auf." (Autorenreferat

Asymmetric first-price auctions with uniform distributions: analytic solutions to the general case

While auction research, including asymmetric auctions, has grown significantly in recent years, there is still little analytical solutions of first-price auctions outside the symmetric case. Even in the uniform case, Griesmer et al. (1967) and Plum (1992) find solutions only to the case where the lower bounds of the two distributions are the same. We present the general analytical solutions to asymmetric auctions in the uniform case for two bidders, both with and without a minimum bid. We show that our solution is consistent with the previously known solutions of auctions with uniform distributions. Several interesting examples are presented including a class where the two bid functions are linear. We hope this result improves our understanding of auctions and provides a useful tool for future research in auctions