Borel stay-in-a-set games

Consider an n-person stochastic game with Borel state space S, compact metric action sets A ₁,A ₂,,A _n , and law of motion q such that the integral under q of every bounded Borel measurable function depends measurably on the initial state x and continuously on the actions (a ₁,a ₂,,a _n ) of the players. If the payoff to each player i is 1 or 0 according to whether or not the stochastic process of states stays forever in a given Borel set G _i , then there is an -equilibrium for every >0. AMS (1991) subject classification: 60G40, 91A60, 60E15, 46A55.     

Evolutionary insights on the willingness to communicate

While in previous models of pre-play communication players are forced to communicate, we investigate what happens if players can choose not to participate in this cheap talk. Outcomes are predicted by analyzing evolutionary stability in a population of a priori identical players. If the game following the communication rewards players who choose the same action then an efficient outcome is only guaranteed when participation in the pre-play communication is voluntary. If however players aim to coordinate on choosing different actions in the underlying game and there are sufficiently many messages then the highest payoff is selected when players are forced to talk to each other before playing the game. Received: September 2000/Revised: March 2003     

级数小于1的亚纯函数的Borel例外值

证明了当超越亚纯函数的级小于1时，其Norel例外值最多只有一个．由于存在任何级的整函数，因此一个例外值总可达到，故所得结果不能再改进。     

Looking for Difference Sets in Groups with Dihedral Images

We prove four theorems about groups with a dihedral (or cyclic) image containing a difference set. For the first two, suppose G, a group of order 2p with p an odd prime, contains a nontrivial (v, k, ) difference set D with order n = k – prime to p and self-conjugate modulo p. If G has an image of order p, then 0 2a + 2 for a unique choice of = ±1, and for a = (k – )/2p. If G has an image of order 2p, then and ( – 1)/( – 1). There are further constraints on n, a and . We give examples in which these theorems imply no difference set can exist in a group of a specified order, including filling in some entries in Smith's extension to nonabelian groups of Lander's tables. A similar theorem covers the case when p|n. Finally, we show that if G contains a nontrivial (v, k, ) difference set D and has a dihedral image D _2m with either (n, m) = 1 or m = p ^t for p an odd prime dividing n, then one of the C ₂ intersection numbers of D is divisible by m. Again, this gives some non-existence results.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

Fuzzy集的基数

关于Fuzzy集的基数，[1]中曾对有限支集的Fuzzy集以及极苛刻条件下的无限Fuzzy集给出过一种定义。但是，正如本文将要指出的那样，该定义是不合理的。本文将从研究Fuzzy映射入手，给出Fuzzy集基数的一般性定义。基于这一定义，不但得到有关基数的大部分结论，而且有其自身的特殊性。     

Connecting orbits among Denjoy minimal sets for monotone twist map

In a Birkhoff region of instability for an exact area-preserving twist map, we construct some orbits connecting distinct Denjoy minimal sets. These sets correspond to the local, instead of global minimum of the Lagrangian action. In the earlier work, Mather constructed connecting orbits among Aubry-Mather sets and the global minimizer of the Lagrangian action.     

Minimal rambling sets with codimension one dominated splittings

In this paper,we study the dynamics of minimal rambling sets with codimension one dominatedsplittings     

Discriminant versus rough sets approach to vague data analysis

This paper presents a comparative study of the use of two different methods of data analysis on a common set of data. The first is a method based on rough sets theory and the second is the location model method from the field of discriminant analysis. To investigate the comparative performance of these methods, a set of real medical data has been used. The data considered are of both discrete and continuous character. During the comparison, particular attention is paid to data reduction and to the derivation of decision rules and classification functions from the reduced set.     

A level set approach for computing discontinuous solutions of Hamilton-Jacobi equations

We introduce two types of finite difference methods to compute the L-solution and the proper viscosity solution recently proposed by the second author for semi-discontinuous solutions to a class of Hamilton-Jacobi equations. By regarding the graph of the solution as the zero level curve of a continuous function in one dimension higher, we can treat the corresponding level set equation using the viscosity theory introduced by Crandall and Lions. However, we need to pay special attention both analytically and numerically to prevent the zero level curve from overturning so that it can be interpreted as the graph of a function. We demonstrate our Lax-Friedrichs type numerical methods for computing the L-solution using its original level set formulation. In addition, we couple our numerical methods with a singular diffusive term which is essential to computing solutions to a more general class of HJ equations that includes conservation laws. With this singular viscosity, our numerical methods do not require the divergence structure of equations and do apply to more general equations developing shocks other than conservation laws. These numerical methods are generalized to higher order accuracy using weighted ENO local Lax-Friedrichs methods as developed recently by Jiang and Peng. We verify that our numerical solutions approximate the proper viscosity solutions obtained by the second author in a recent Hokkaido University preprint. Finally, since the solution of scalar conservation law equations can be constructed using existing numerical techniques, we use it to verify that our numerical solution approximates the entropy solution.