Introspection and equilibrium selection in 2 × 2 matrix games

Game theory lacks an explanation of how players' beliefs are formed and why they are in equilibrium. This is the reason why it has failed to make significant advances with the problem of equilibrium selection even for quite simple games, as 2 × 2 games with two strict Nash equilibria. Our paper models the introspection process by which the selected equilibrium is achieved in this class of games. Players begin their analysis with imprecise priors, obtained under weak restrictions formulated as Axioms. For a large class of reasoning dynamics we obtain as the solution the risk dominant Nash equilibrium.     

n-ary fragmentation model with nearest point flaw and maximal net force fracture

Through the distinction between “real” and “virtual” links between the nodes of a graph, we develop a set of simple rules leading to scale-free networks with a tunable degree distribution exponent. Albeit sharing some similarities with preferential attachment, our procedure is both faster than a naïve implementation of the Barabási and Albert model and exhibits different clustering properties. The model is thoroughly studied numerically and suggests that reducing the set of partners a node can connect to is important in seizing the diversity of scale-free structures.     

Semi-discretization in time and numerical convergence of solutions of a nonlinear cross-diffusion population model

Summary. A positivity-preserving numerical scheme for a strongly coupled cross-diffusion model for two competing species is presented, based on a semi-discretization in time. The variables are the population densities of the species. Existence of strictly positive weak solutions to the semidiscrete problem is proved. Moreover, it is shown that the semidiscrete solutions converge to a non-negative solution of the continuous system in one space dimension. The proofs are based on a symmetrization of the problem via an exponential transformation of variables and the use of an entropy functional. Received September 10, 2001 / Revised version received February 25, 2002 / Published online June 17, 2002     

Indexing text with approximate q-grams

We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their positions. At search time, part of the text is filtered out by noticing that any occurrence of the pattern must be reflected in the presence of some text q-samples that match approximately inside the pattern. Hence the index points out the text areas that could contain occurrences and must be verified. The index parameters permit load balancing between filtering and verification work, and provide a compromise between the space requirement of the index and the error level for which the filtration is still efficient. We show experimentally that the index is competitive against others that take more space, being in fact the fastest choice for intermediate error levels, an area where no current index is useful.     

Bit-parallel -matching and suffix automata

(δ,γ)-matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P_1…m and a text T_1…n on an alphabet of integers, find the occurrences P^′ of the pattern in the text such that (i) , and (ii) . The problem makes sense for δγδm. Several techniques for (δ,γ)-matching have been proposed, based on bit-parallelism or on skipping characters. We first present an O(mnlog(γ)/w) worst-case time and O(n) average-case time bit-parallel algorithm (being w the number of bits in the computer word). It improves the previous O(mnlog(δm)/w) worst-case time algorithm of the same type. Second, we combine our bit-parallel algorithm with suffix automata to obtain the first algorithm that skips characters using both δ and γ. This algorithm examines less characters than any previous approach, as the others do just δ-matching and check the γ-condition on the candidates. We implemented our algorithms and drew experimental results on real music, showing that our algorithms are superior to current alternatives with high values of δ.     

Steady filtration problems with seawater intrusion: macro‐hybrid penalized finite element approximations

Macro‐hybrid penalized finite element approximations are studied for steady filtration problems with seawater intrusion. On the basis of nonoverlapping domain decompositions with vertical interfaces, sections of coastal aquifers are decomposed into subsystems with simpler geometries and small scales, interconnected via transmission conditions of pressure and flux continuity. Corresponding local penalized formulations are derived from the global penalized variational formulation of the two‐free boundary flow problem, with continuity transmission conditions modelled variationally in a dual sense. Then, macro‐hybrid finite element approximations are derived for the system, defined on independent subdomain grids. Parallel relaxation penalty‐duality algorithms are proposed from fixed‐point problem characterizations. Numerical experiments exemplify the macro‐hybrid penalized theory, showing a good agreement with previous primal conforming penalized finite element approximations (Comput. Methods Appl. Mech. Engng. 2000; 190 :609–624). Copyright © 2005 John Wiley & Sons, Ltd.     

Banach Spaces Admitting a Separating Polynomial and L P Spaces

 We prove that in a Banach space admitting a separating polynomial, each weakly null normalized sequence has a subsequence which is equivalent to the usual basis of some , p an even integer. We show that for each even integer p, the Schatten class admits a separating polynomial. For a space with a basis admitting a 4-homogeneous separating polynomial, we relate the unconditionality of the basis with the existence of certain type of polynomials defined in terms of infinite symmetric matrices. We find relations between the properties of the entries of these matrices and the geometrical structure of the space. Finally we study the existence of convex 4-homogeneous separating polynomials.     

A Minimal,Unstrained S‐Allyl Handle for Pre‐Targeting Diels–Alder Bioorthogonal Labeling in Live Cells

The unstrained S‐allyl cysteine amino acid was site‐specifically installed on apoptosis protein biomarkers and was further used as a chemical handle and ligation partner for 1,2,4,5‐tetrazines by means of an inverse‐electron‐demand Diels–Alder reaction. We demonstrate the utility of this minimal handle for the efficient labeling of apoptotic cells using a fluorogenic tetrazine dye in a pre‐targeting approach. The small size, easy chemical installation, and selective reactivity of the S‐allyl handle towards tetrazines should be readily extendable to other proteins and biomolecules, which could facilitate their labeling within live cells.