Dynamic Strategic Pricing and Speed of Diffusion

Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices.     

Orders of Indescribable Sets

We extract some properties of Mahlo’s operation and show that some other very natural operations share these properties. The weakly compact sets form a similar hierarchy as the stationary sets. The height of this hierarchy is a large cardinal property connected to saturation properties of the weakly compact ideal.     

Action learning versus strategy learning

This article seeks to ascertain whether the strategy‐learning model of Hanaki, Sethi, Erev, and Peterhansl (2003) better accounts for observed behavior than do the various action‐learning models. It does so by measuring the goodness‐of‐fit of the models' predictions against published experimental results for such games as Coordination, Prisoner's Dilemma, and Chicken. The fit is measured via the mean squared deviation (MSD) between the observed behavior and the one predicted by the model. The results show that, for Chicken, the strategy‐learning model fits the observed data much better than do the action‐learning models. The best action‐learning model, on the other hand, fits the observed data well in Coordination. Overall, the strength of the strategy‐learning model is best shown in games where alternations between the two stage‐game Nash equilibria are often observed in the laboratory experiments. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–50, 2004     

Essential domains and two conjectures in dimension theory

This note investigates two long-standing conjectures on the Krull dimension of integer-valued polynomial rings and of polynomial rings in the context of (locally) essential domains.

     

THE FIRST EXPERIMENT OF A THz GYROTRON WITH A PULSE MAGNET

A THz gyrotron with a pulse magnet has been designed, constructed and operated in FIR FU. It is developed as one of high frequency gyrotrons included in Gyrotron FU Series. The gyrotron has already achieved the first experimental result for high frequency operations whose radiation frequency exceeds 1 THz. In this paper, the design detail and the operation test results for sub-terahertz to terahertz range are described. The second harmonic operation is confirmed experimentally at the expected frequency of 1.005 THz due to TE_6,11 cavity mode at the magnetic field intensity of 19.0 T.     

一类过程摄动系统的无阻塞鲁棒性

使用参数Dioid模块网络法,把含大量摄动参数的在普通极大代数意义下非线性状态空间模型在参数Dioid意义下线性化,在此基础上研究一类过程摄动系统的无阻塞鲁棒性.给出了有限缓冲串行生产系统在没有缓冲器下无阻塞的充要条件和充分条件.     

Noninferior Nash Strategies for Multi-Team Systems

This paper is concerned with the optimization of systems that are controlled by several teams of decision makers. The decision makers within each team cooperate for the benefit of their team. On the other hand, the teams compete among themselves in order to achieve an objective that relates to the overall performance of the system. An approach that merges concepts from team theory and game theory for dealing with such systems and a solution called the noninferior Nash strategy are introduced. This multi-team solution provides a new framework for analyzing hierarchically controlled systems so as to address complicated coordination problems among the decision makers. The properties of the noninferior Nash solution in static multi-team systems are investigated and necessary conditions for its existence are derived. Analytical expressions for the noninferior Nash strategies are derived for a class of linear-quadratic static multi-team games. In order to deal with the issue of nonuniqueness of the solution, the concept of a noninferior Nash strategy with a team leader is introduced. Several examples are presented to illustrate the results.     

A saxpy formulation for plane rotations

An algorithm for pre- or post-multiplication of a matrix by a plane rotation, using only three vector saxpy operations instead of the four vector operations usually considered necessary, is described. No auxiliary storage for overwriting is required. The method is shown to be numerically stable.     

Cohomology operations and the deligne conjecture

The aim of this note, which raises more questions than it answers, is to study natural operations acting on the cohomology of various types of algebras. It contains a lot of very surprising partial results and examples.     

A conjecture of M. J. Taylor concerning determinantal congruences

Let G be a finite group. The class group of the group ring of G is a quotient of the idèlic homomorphisms of R(G) by the global functions and the determinantal functions. Using Explicit Brauer Induction, we prove Adams operations, applied to determinantal functions, satisfy some congruences which were conjectured by M. J. Taylor. As an application, we construct some new maps defined on the class group.In memory of J. Frank Adams (1930–1989)Research partially supported by NSERC Grant # 0GP0042580.