Tacit collusion and capacity withholding in repeated uniform price auctions

This paper contributes to the study of tacit collusion by analyzing infinitely repeated multiunit uniform price auctions in a symmetric oligopoly with capacity constrained firms. Under both the Market Clearing and Maximum Accepted Price rules of determining the uniform price, we show that when each firm sets a price-quantity pair specifying the firm's minimum acceptable price and the maximum quantity the firm is willing to sell at this price, there exists a range of discount factors for which the monopoly outcome with equal sharing is sustainable in the uniform price auction, but not in the corresponding discriminatory auction. Moreover, capacity withholding may be necessary to sustain this out-come. We extend these results to the case where firms may set bids that are arbitrary step functions of price-quantity pairs with any finite number of price steps. Surprisingly, under the Maximum Accepted Price rule, firms need employ no more than two price steps to minimize the value of the discount factor

User-friendly parallel computations with econometric examples

This paper shows how a high level matrix programming language may be used to perform Monte Carlo simulation, bootstrapping, estimation by maximum likelihood and GMM, and kernel regression in parallel on symmetric multiprocessor computers or clusters of workstations. The implementation of parallelization is done in a way such that an investigator may use the programs without any knowledge of parallel programming. A bootable CD that allows rapid creation of a cluster for parallel computing is introduced. Examples show that parallelization can lead to important reductions in computational time. Detailed discussion of how the Monte Carlo problem was parallelized is included as an example for learning to write parallel programs for Octave.

Corrigendum to "On randomized matching mechanisms" [Economic Theory 8(1996)377-381]

Ma (1996) studied the random order mechanism, a matching mechanism suggested by Roth and Vande Vate (1990) for marriage markets. By means of an example he showed that the random order mechanism does not always reach all stable matchings. Although Ma's (1996) result is true, we show that the probability distribution he presented - and therefore the proof of his Claim 2 - is not correct. The mistake in the calculations by Ma (1996) is due to the fact that even though the example looks very symmetric, some of the calculations are not as ''symmetric.''

Does bounded rationality lead to individual heterogeneity? The impact of the experimentation process and of memory constraints

In this paper we explore the effect of bounded rationality on the convergence of individual behavior toward equilibrium. In the context of a Cournot game with a unique and symmetric Nash equilibrium, firms are modeled as adaptive economic agents through a genetic algorithm. Computational experiments show that (1) there is remarkable heterogeneity across identical but boundedly rational agents; (2) such individual heterogeneity is not simply a consequence of the random elements contained in the genetic algorithm; (3) the more rational agents are in terms of memory abilities and pre-play evaluation of strategies, the less heterogeneous they are in their actions. At the limit case of full rationality, the outcome converges to the standard result of uniform individual behavior.

Is bundling anticompetitive?

I analyze the implications of bundling on price competition in a market for complementary products. Using a model of imperfect competition with product differentiation, I identify the incentives to bundle for two types of demand functions and study how they change with the size of the bundle. With an inelastic demand, bundling creates an advantage over uncoordinated rivals who cannot improve by bundling. I show that this no longer holds with an elastic demand. The incentives to bundle are stronger and the market outcome is symmetric bundling, the most competitive one. Profits are lowest and consumer surplus is maximized.

An ordinal shapley value for economic environments

We propose a new solution concept to address the problem of sharing a surplus among the agents generating it. The sharing problem is formulated in the preferences-endowments space. The solution is defined in a recursive manner incorporating notions of consistency and fairness and relying on properties satisfied by the Shapley value for Transferable Utility (TU) games. We show a solution exists, and refer to it as an Ordinal Shapley value (OSV). The OSV associates with each problem an allocation as well as a matrix of concessions ``measuring'' the gains each agent foregoes in favor of the other agents. We analyze the structure of the concessions, and show they are unique and symmetric. Next we characterize the OSV using the notion of coalitional dividends, and furthermore show it is monotone in an agent's initial endowments and satisfies anonymity. Finally, similarly to the weighted Shapley value for TU games, we construct a weighted OSV as well.

When does universal peace prevail? Secession and group formation in rent seeking contests and policy conflicts

This paper analyzes secession and group formation in a general model of contest inspired by Esteban and Ray (1999). This model encompasses as special cases rent seeking contests and policy conflicts, where agents lobby over the choice of a policy in a one-dimensional policy space. We show that in both models the grand coalition is the efficient coalition structure and agents are always better off in the grand coalition than in a symmetric coalition structure. Individual agents (in the rent seeking contest) and extremists (in the policy conflict) only have an incentive to secede when they anticipate that their secession will not be followed by additional secessions. Incentives to secede are lower when agents cooperate inside groups. The grand coalition emerges as the unique subgame perfect equilibrium outcome of a sequential game of coalition formation in rent seeking contests.

Structural inferences from first-price auction experiments

We use structural methods to assess equilibrium models of bidding with data from first-price auction experiments. We identify conditions to test the Nash equilibrium models for homogenous and for heterogeneous constant relative risk aversion when bidders private valuations are independent and uniformly drawn. The outcomes of our study indicate that behavior may have been affected by the procedure used to conduct the experiments and that the usual Nash equilibrium model for heterogeneous constant relative risk averse bidders does not consistently explain the observed overbidding. From an empirical standpoint, our analysis shows the possible drawbacks of overlooking the homogeneity hypothesis when testing symmetric equilibrium models of bidding and it puts in perspective the sensitivity of structural inferences to the available information.

Mediation incomplete information bargaining with filtered communication

We analyze a continuous-time bilateral double auction in the presence of two-sided incomplete information and a smallest money unit. A distinguishing feature of our model is that intermediate concessions are not observable by the adversary: they are only communicated to a passive auctioneer. An alternative interpretation is that of mediated bargaining. We show that an equilibrium using only the extreme agreements always exists and display the necessary and sufficient condition for the existence of (perfect Bayesian) equilibra which yield intermediate agreements. For the symmetric case with uniform type distribution we numerically calculate the equilibria. We find that the equilibrium which does not use compromise agreements is the least efficient, however, the rest of the equilibria yield the lower social welfare the higher number of compromise agreements are used.

Infinite index subgroups and finiteness properties of intersections of geometrically finite groups

We explore which types of finiteness properties are possible for intersections of geometrically finite groups of isometries in negatively curved symmetric rank one spaces. Our main tool is a twist construction which takes as input a geometrically finite group containing a normal subgroup of infinite index with given finiteness properties and infinite Abelian quotient, and produces a pair of geometrically finite groups whose intersection is isomorphic to the normal subgroup.

On the injectivity of the Kudla-Millson lift and surjectivity of the Borcherds lift

We consider the Kudla-Millson lift from elliptic modular forms of weight (p+q)/2 to closed q-forms on locally symmetric spaces corresponding to the orthogonal group O(p,q). We study the L²-norm of the lift following the Rallis inner product formula. We compute the contribution at the Archimedian place. For locally symmetric spaces associated to even unimodular lattices, we obtain an explicit formula for the L²-norm of the lift, which often implies that the lift is injective. For O(p,2) we discuss how such injectivity results imply the surjectivity of the Borcherds lift.

Leadership and overcoming coordination failure with asymmetric costs

We study how the heterogeneity of agents affects the extent to which changes in financial incentives can pull a group out of a situation of coordination failure. We focus on the connections between cost asymmetries and leadership. Experimental subjects interact in groups of four in a series of weak-link games. The treatment variable is the distribution of high and low effort cost across subjects. We present data for one, two and three low-cost subjects as well as control sessions with symmetric costs. The overall pattern of coordination improvement is common across treatments. Early coordination improvements depend on the distribution of high and low effort costs across subjects, but these differences disappear with time. We find that initial leadership in overcoming coordination failure is not driven by low-cost subjects but by subjects with the most frequent cost. This conformity effect can be due to a kind of group identity or to the cognitive simplicity of acting with identical others.

Norm inequalities in multidimensional Lorentz spaces

In this paper we obtain necessary and sufficient conditions for double trigonometric series to belong to generalized Lorentz spaces, not symmetric in general. Estimates for the norms are given in terms of coefficients.

Invariants de matrius Hadamard en MAGMA

L'objectiu d'aquest projecte ha estat generalitzar i integrar la funcionalitat de dos projectes anteriors que ampliaven el tractament que oferia el Magma respecte a les matrius de Hadamard. Hem implementat funcions genèriques que permeten construir noves matrius Hadamard de qualsevol mida per a cada rang i dimensió de nucli, i així ampliar la seva base de dades. També hem optimitzat la funció que calcula el nucli, i hem desenvolupat funcions que calculen la invariant Symmetric Hamming Distance Enumerator (SH-DE) proposada per Kai-Tai Fang i Gennian Gei que és més sensible per a la detecció de la no equivalència de les matrius Hadamard.

A class of stochastic games with infinitely many interacting agents related to Glauber dynamics on random graphs

We introduce and study a class of infinite-horizon nonzero-sum non-cooperative stochastic games with infinitely many interacting agents using ideas of statistical mechanics. First we show, in the general case of asymmetric interactions, the existence of a strategy that allows any player to eliminate losses after a finite random time. In the special case of symmetric interactions, we also prove that, as time goes to infinity, the game converges to a Nash equilibrium. Moreover, assuming that all agents adopt the same strategy, using arguments related to those leading to perfect simulation algorithms, spatial mixing and ergodicity are proved. In turn, ergodicity allows us to prove “fixation”, i.e. that players will adopt a constant strategy after a finite time. The resulting dynamics is related to zerotemperature Glauber dynamics on random graphs of possibly infinite volume.