Consistency of assessments in infinite signaling games

In this paper we investigate possible ways to define consistency of assessments in infinite signaling games, i.e. signaling games in which the sets of types, messages and answers are complete, separable metric spaces. Roughly speaking, a consistency concept is called appropriate if it implies Bayesian consistency and copies the original idea of consistency in finite extensive form games as introduced by ^{Kreps and Wilson (Econometrica 1982, 50, 863–894)}. We present a particular appropriate consistency concept, which we call strong consistency and give a characterization of strongly consistent assessments. It turns out that all appropriate consistency concepts are refinements of strong consistency. Finally, we define and characterize structurally consistent assessments in infinite signaling games.     

Multiprincipals multiagents incentive design

This paper studies a simple setting in which the contractual arrangements which determine the incentives for agents are not designed by a single central planner, but are themselves the outcome of a game among multiple noncooperatively acting principals. The notion of an Epsilon Contracting Equilibrium is introduced to predict the outcome of the contract-design game among principals. Symmetric pure strategy Epsilon Contracting Equlibria may not exist in perfectly symmetric environments. In a symmetric Epsilon Contracting Equilibrium in mixed strategies coordination failure may lead to a suboptimal institutional network in which the agents “cheat” their principals. Received: 14 June 1995 / Accepted: 09 August 1999     

The not-so-secret-agent: Professional monitors,hierarchies and implementation

Abstract. It is well-known that, when agents in an organization possess private information that is unverifiable by an outside party, games where agents simply announce their information can have multiple equilibria that may impede the successful implementation of the organization's objectives. We show that the introduction of a professional monitor (e.g. auditor, regulator, supervisor) can help to destroy the “bad' equilibria when agents have private information but have incomplete info rmation about others' information. Received: 21 May 1998 / Accepted: 26 May 2000     

On efficient trading mechanisms between one seller and n buyers

Myerson and Satterthwaite (1983) prove that if one seller and one buyer have independent private valuations for an indivisible object then no individually rational and incentive compatible trading mechanism can guarantee ex post efficiency when gains from trade are uncertain. Makowski and Mezzetti (1993) show that this is not the case when there are at least two buyers. In the latter context, if the highest possible seller's valuation is not too large, we provide an ex post efficient mechanism in which the mechanism designer and the agents are not required to know the probability distribution for the seller's valuation. Received: February 18, 1998 / Accepted: September 10, 1999     

Achieving the first best in sequencing problems

Abstract. In a sequencing problem with linear time cost, Suijs (1996) proved that it is possible to achieve first best. By first best we mean that one can find mechanisms that satisfy efficiency of decision, dominant strategy incentive compatibility and budget balancedness. In this paper we show that among a more general and natural class of sequencing problems, sequencing problems with linear cost is the only class for which first best can be achieved. Received: 2 December 1999/Accepted: 9 May 2001     

What restrictions do Bayesian games impose on the value of information?

In a Bayesian game players play an unknown game. Before the game starts some players may receive a signal regarding the specific game actually played. Typically, information structures that determine different signals, induce different equilibrium payoffs. In two-person zero-sum games the equilibrium payoff measures the value of the particular information structure which induces it. We pose a question as to what restrictions Bayesian games impose on the value of information. We provide answers for two kinds of information structures: symmetric, where both players are equally informed, and one-sided, where only one player is informed.     

The hybrid equilibria and core selection in exchange economies with externalities

This paper introduces a hybrid equilibrium concept that combines the elements of cooperative and non-cooperative behaviors in an exchange economy with externalities. For a fixed coalition structure (or a partition of traders), the hybrid equilibrium is a price and consumption bundle such that each coalition chooses a core solution from its budget set and the consumption bundles are feasible. It becomes the competitive equilibrium when the position is the finest, and it selects a core allocation when the partition is the coarsest. The paper provides sufficient conditions for the existence of a hybrid equilibrium for any coalition structure.     

A characterization of the existenceof optimal dominant strategy mechanisms

This paper provides two theorems which characterize the domains of valuation functions for which there exist Pareto efficient and truth dominant strategy mechanisms (balanced Groves mechanisms). Theorem 1 characterizes the existence of balanced Groves mechanisms for a general class of valuation functions. Theorem 2 provides new balance-permitting domains of valuation functions by reducing the problem of solving partial differential equations to the problem of solving a polynomial function. It shows that a balanced Groves mechanism exists if and only if each valuation function in the family under consideration can be obtained by solving a polynomial function with order less than , where n is the number of individuals. Received: 5 January 1997 / Accepted: 25 May 1999     

Single-peakedness and coalition-proofness

We prove that multidimensional generalized median voter schemes are coalition-proof. Received: 16 July 1998 / Accepted 23 March 1999     

A strategic analysis of network reliability

Abstract. We consider a non-cooperative model of information networks where communication is costly and not fully reliable. We examine the nature of Nash networks and efficient networks. We find that if the society is large, and link formation costs are moderate, Nash networks as well as efficient networks will be ‘super-connected’ i.e. every link is redundant in the sense that the network remains connected even after the link is deleted. This contrasts with the properties of a deterministic model of information decay, where Nash networks typically involve unique paths between agents. We also find that if costs are very low or very high, or if links are highly reliable then there is virtually no conflict between efficiency and stability. However, for intermediate values of costs and link reliability, Nash networks may be underconnected relative to the social optimum.     

Abstention and political competition

The classical literature on spatial majority voting postulates that all citizens vote. The Median Voter Theorem (MVT) then obtains when parties have perfect information on voter behavior and are either office-seekers (“Downsian”) or ideological. This paper introduces abstention, a simple yet realistic modification. We show that the main features of the MVT survive to a large extent but subject to some qualifications. First, the winning policy does not bear any necessary relation to the median voter. Second, there exist examples in which the candidates choose different positions at equilibrium. Third, equilibrium may fail to exist or be unique. Finally, the equilibria of the model with office-motivated parties may differ from the ones where parties are ideological. Received: 18 September 1999 / Accepted: 31 January 2000     

On the generalized principal-agent problem: Decomposition and existence results

This paper addresses the class of generalized agency problems: situations in which adverse selection and moral hazard are jointly present. We present a decomposition of the principal's optimization problem under the first-order approach that sheds light on the interactions between the two types of private information, and also significantly improves tractability. We use the decomposition to (1) provide examples of closed form solutions of the optimal contract, and (2) analyze the existence of optimal contracts. We also show that the first-order approach is valid in generalized agency problems if the production technology satisfies the linear distribution function condition (LDFC) in actions and types. For more general production technologies the Mirrlees-Rogerson sufficient conditions need to be extended to include restrictions on the form of the optimal contract. Received: 11 August 1997 / 26 September 1999     

Implementation of multi-agent incentive contracts with the principal's renegotiation offer

The purpose of this paper is to explore a mechanism for supporting desired equilibrium actions in a one-principal, multi-agent model when the principal makes a renegotiation offer. We show that there exists a mechanism in which the principal's most preferred mixed strategy is always supported. Received: 30 May 1997 / Accepted: 10 October 1998     

Metonymy and cross-section demand

Cross-section consumer expenditure data are frequently used to draw conclusions about consumer demand behavior. Such conclusions, however, are justified only under certain assumptions, which are often left unstated in the empirical demand literature. An assumption of this type, the metonymy hypothesis, was stated rigorously and exploited by Härdle et al. when analyzing the monotonicity of aggregate demand functions. The purpose of the present paper is to examine the metonymy hypothesis in more detail. We prove that the distribution of demand vectors derived from a not necessarily metonymic population is identical with the distribution derived from some metonymic population. This implies, in particular, that the metonymy hypothesis cannot be rejected or confirmed on the basis of data from a single cross-section.