Non-cooperative bargaining in apex games and the kernel

This paper studies non-cooperative bargaining with random proposers in apex games. Two different protocols are considered: the egalitarian protocol, which selects each player to be the proposer with equal probability, and the proportional protocol, which selects each player with a probability proportional to his number of votes. Expected equilibrium payoffs coincide with the kernel for the grand coalition regardless of the protocol. The equilibrium is in mixed strategies and the indifference conditions can be reinterpreted in the language of the kernel.     

A baseline model of industry evolution

The paper analyses some general dynamic properties of industries characterized by heterogeneous firms and continuing stochastic entry.After a brief critical assessment of some significant drawbacks of recent contributions to modeling of stochastic industrial dynamics, we propose a novel analytical apparatus able to derive some generic properties of the underlying competition process combining persistent technological heterogeneity, differential growth of individual firms and turnover. The basic model, we suggest, is indeed applicable with proper modifications to a large class of evolutionary processes, well beyond industrial dynamics.JEL Classification: L11, O30, C60Support to this research by the International Institute for Applied Systems Analysis (IIASA), Austria; the Fujitsu Research Institute for Advanced Information (FRI), Japan; the Italian National Research Council (CNR), the Italian Ministry of Education, University and Research (MIUR, prot. 2002132413 003) and the Free University of Bozen Bolzano, Italy, is gratefully acknowledged. Comments by Andrea Bassanini, Francesca Chiaromonte, Steven Klepper, Uwe Cantner, Drew Fudenberg and the anonymous referees helped in shaping the paper to its present form. Mariele Berté provided the computer simulations of the model. The usual caveats apply.Correspondence to: G. Dosi     

Knowledge Disclosure and Transmission in Buyer–Supplier Relationships

A buyer’s technical knowledge may increase the efficiency of its supplier. Suppliers, however, frequently maintain relationships with additional buyers. Knowledge disclosure then bears the risk of benefiting one’s own rival due to opportunistic knowledge transmission through the common supplier. We show that in one-shot relationships no knowledge disclosure takes place because the supplier has an incentive to transmit and, anticipating that, buyers refuse to disclose any of their knowledge. In repeated relationships knowledge disclosure is stabilized by larger technological proximity between buyers and suppliers and destabilized by the absolute value of the knowledge.      

Acceptability and Ethics of Product Placement in Sport Video Games

Product placement in sport video games is an emerging area of marketing and advertising communication, but it also raises controversial ethical issues. In order to investigate these issues from a consumer perspective, this study examines the perceptions of the acceptability of product placement in sport video games (SVGs). Data were gathered from 253 sport video gamers using an online survey. The results indicate that while sport video gamers generally have favorable attitudes toward product placement in sport video games, ethically-charged products such as alcohol, cigarettes, and guns are perceived as less acceptable than other products. Individual differences among sport video gamers are found based on their related attitudes, hours of playing sport video games, and gender. Also, sport video gamers who have favorable attitudes toward product placement, in general, are more likely to intend to purchase a product or brand which may be placed in sport video games.     

Finite supermodular design with interdependent valuations

This paper studies supermodular mechanism design in environments with arbitrary (finite) type spaces and interdependent valuations. In these environments, the designer may have to use Bayesian equilibrium as a solution concept, because ex-post implementation may not be possible. We propose direct (Bayesian) mechanisms that are robust to certain forms of bounded rationality while controlling for equilibrium multiplicity. In quasi-linear environments with informational and allocative externalities, we show that any Bayesian mechanism that implements a social choice function can be converted into a supermodular mechanism that also implements the original decision rule. The proposed supermodular mechanism can be chosen in a way that minimizes the size of the equilibrium set, and we provide two sets of sufficient conditions to this effect. This is followed by conditions for supermodular implementation in unique equilibrium.     

湖北省地方高校田径运动会改革的研究

运用文献资料法、调查法、数理统计等方法;从目前各高校校运动会的参与人数与满意度、参与目的、情意期望等方面,对湖北部分地方高校田径运动会的现状做出调查研究;并对其改革进行了探讨,使其能为地方高校田径运动的发展提供参考。     

Robust rational turnout

We show that equilibria of a class of participation games (Palfrey and Rosenthal in Public Choice 41(1):7–53, 1983; Journal of Public Economics 24(2):171–193, 1984) exhibit minimal heterogeneity of behavior so that players’ mixed strategies are summarized by at most two probabilities. We then establish that, except for a finite set of common costs of participation, these games are regular. Thus, equilibria of these voting games are robust to general payoff perturbations and survive in nearby games of incomplete information. Thanks to participants of the 2006 MPSA conference for comments on an early version.     

Reinforcement-Based Adaptive Learning in Asymmetric Two-Person Bargaining with Incomplete Information

The sealed bidk-double auction is a mechanism used to structure bilateral bargaining under two-sided incomplete information. This mechanism is tested in two experiments in which subjects are asked to bargain repeatedly for 50 rounds with the same partner under conditions of information disparity favoring either the buyer (Condition BA) or seller (Condition SA). Qualitatively, the observed bid and offer functions are in agreement with the Bayesian linear equilibrium solution (LES) constructed by Chatterjee and Samuelson (1983). A trader favored by the information disparity, whether buyer or seller, receives a larger share of the realized gain from trade than the other trader. Comparison with previous results reported by Daniel, Seale, and Rapoport (1998), who used randomly matched rather than fixed pairs, shows that when reputation effects are present this advantage is significantly enhanced. A reinforcement-based learning model captures the major features of the offer and bid functions, accounting for most of the variability in the round-to-round individual decisions.     

On large games with bounded essential coalition sizes

We consider games in characteristic function form where the worth of a group of players depends on the numbers of players of each of a finite number of types in the group. The games have bounded essential coalition sizes: all gains to cooperation can be achieved by coalitions bounded in absolute size (although larger coalitions are permitted they cannot realize larger per-capita gains). We show that the utility function of the corresponding "limit" market, introduced in Wooders (1988, 1994a) , is piecewise linear. The piecewise linearity is used to show that for almost all limiting ratios of percentages of player-types, as the games increase in size (numbers of players), asymptotically the games have cores containing only one payoff, and this payoff is symmetric (treats players of the same type identically). We use this result to show that for almost all limiting ratios of percentages of player-types, Shapley values of sequences of growing games converge to the unique limiting payoff.     

Repeated signaling games

I analyze a class of repeated signaling games in which the informed player's type is persistent and the history of actions is perfectly observable. In this context, a large class of possibly complex sequences of signals can be supported as the separating equilibrium actions of the “strong type” of the informed player. I characterize the set of such sequences. I also characterize the sequences of signals in least cost separating equilibria (LCSE) of these games. In doing this, I introduce a state variable that can be interpreted as a measure of reputation. This gives the optimization problem characterizing the LCSE a recursive structure. I show that, in general, the equilibrium path sequences of signals have a simple structure. The shapes of the optimal sequences depend critically on the relative concavities of the payoff functions of different types, which measure the relative preferences towards payoff smoothing.