A game locating a needle in a circular haystack

A complete solution of the following Hider-Seeker zero-sum game is obtained. The hider hides a needle of lengtha, 0<a2, in the closed unit dise, and the seeker tries to locate it by shooting in a straight line across the disc. The payoff to the seeker is 1 if he hits the needle and 0 otherwise.     

Occupation games on graphs in which the second player takes almost all vertices

Given a connected graph G=(V,E), two players take turns occupying vertices v∈V by placing black and white tokens so that the current vertex sets B,W⊆V are disjoint, B∩W=0?, and the corresponding induced subgraphs G[B] and G[W] are connected any time. A player must pass whenever (s)he has no legal move. (Obviously, after this, the opponent will take all remaining vertices, since G is assumed connected.) The game is over when all vertices are taken, V=B^∗∪W^∗. Then, Black and White get b=|B^∗|/|V| and w=|W^∗|/|V|, respectively. Thus, the occupation game is one-sum, b+w=1, and we could easily reduce it to a zero-sum game by simply shifting the payoffs, b^′=b−1/2,w^′=w−1/2. Let us also notice that b≥0 and w≥0; moreover, b>0 and w>0 whenever |V|>1.[Let us remark that the so-called Chinese rules define similar payoffs for the classic game of GO, yet, the legal moves are defined in GO differently.]Like in GO, we assume that Black begins. It is easy to construct graphs in which Black can take almost all vertices, more precisely, for each ε>0 there is a graph G for which b>1−ε. In this paper we show that, somewhat surprisingly, there are also graphs in which White can take almost all vertices.     

Noncooperative exchange using money and broker-dealers

This paper presents a model of exchange where a single commodity serves as a means of payment and trade must pass through designated brokers. Broker buy and sell prices, trader allocations, and broker profits depend on the buy and sell decisions of all the market participants, and the exchange problem is described as a noncooperative game. The existence of an equilibrium is established and bounds are placed on the price spread on each commodity. Finally, the properties of the noncooperative equilibria under replication are examined.     

A potential approach for ordinal games

We introduce the class of ordinal games with a potential, which are characterized by the absence of weak improvement cycles, the same condition used by Voorneveld and Norde (1997) for ordinal potential games.     

Abraham model correlations for transfer of neutral molecules and ions to sulfolane

Data have been compiled from the published literature on the partition coefficients of solutes and vapors into anhydrous sulfolane. The logarithms of the water-to-sulfolane partition coefficients, log P, and gas-to-sulfolane partition coefficients, log K, were correlated with the Abraham solvation parameter model. The derived correlations described the observed log P and log K values for solutes dissolved in sulfolane to within average standard deviations of 0.14 log units or less. The log P correlation was extended to include the partition of ions by inclusion of a cation-solvent and an anion-solvent term.     

Determination of partition behavior of organic surrogates between paperboard packaging materials and air

The suitability of recycled paperboard packaging materials for direct food contact applications is a major area of investigation. Chemical contaminants (surrogates) partitioning between recycled paper packaging and foods may affect the safety and health of the consumer. The partition behavior of all possible organic compounds between cardboards and individual foodstuffs is difficult and too time consuming for being fully investigated. Therefore it may be more efficient to determine these partition coefficients indirectly through experimental determination of the partitioning behavior between cardboard samples and air. In this work, the behavior of organic pollutants present in a set of two paper and board samples intended to be in contact with foods was studied. Adsorption isotherms have been plotted and partition coefficients between paper and air have been calculated as a basis for the estimation of their migration potential into food. Values of partition coefficients (Kpaper/air) from 47 to 1207 were obtained at different temperatures. For the less volatile surrogates such as dibutyl phthalate and methyl stearate higher Kpaper/air values were obtained. The adsorption curves showed that the more volatile substances are partitioning mainly in air phase and increasing the temperature from 70 to 100 degrees C their concentrations in air (Cair) have almost doubled. The analysis of surrogates was performed with a method based on solvent extraction and gas chromatographic-flame ionization detection (GC-FID) quantification.     

Developing real option game models

By mixing concepts from both game theoretic analysis and real options theory, an investment decision in a competitive market can be seen as a “game” between firms, as firms implicitly take into account other firms’ reactions to their own investment actions. We review two decades of real option game models, suggesting which critical problems have been “solved” by considering game theory, and which significant problems have not been yet adequately addressed. We provide some insights on the plausible empirical applications, or shortfalls in applications to date, and suggest some promising avenues for future research.     

Partition numbers

We continue [21] and study partition numbers of partial orderings which are related to (ω)/fin. In particular, we investigate P_f, be the suborder of ((ω)/fin)^ω containing only filtered elements, the Mathias partial order M, and (ω), (ω)^ω the lattice of (infinite) partitions of ω, respectively. We show that Solomon's inequality holds for M and that it consistently fails for P_f. We show that the partition number of (ω) is C. We also show that consistently the distributivity number of (ω)^ω is smaller than the distributivity number of (ω)/fin. We also investigate partitions of a Polish space into closed sets. We show that such a partition either is countable or has size at least D, where D is the dominating number. We also show that the existence of a dominating family of size ₁ does not imply that a Polish space can be partitioned into ₁ many closed sets.     

Definitions of equilibrium in network formation games

We examine a variety of stability and equilibrium definitions that have been used to study the formation of social networks among a group of players. In particular we compare variations on three types of definitions: those based on a pairwise stability notion, those based on the Nash equilibria of a link formation game, and those based on equilibria of a link formation game where transfers are possible.Bloch is also affiliated with the University of Warwick.     

Maximal Element Theorems with Applications to Generalized Games and Systems of Generalized Vector Quasi-Equilibrium Problems in <Emphasis Type="Italic">G</Emphasis>-Convex Spaces

By applying the maximal element theorems on product of G-convex spaces due to the first author, some equilibrium existence theorems for generalized games with fuzzy constraint correspondences are proved in G-convex spaces. As applications, some existence theorems of solutions for the system of generalized vector quasiequilibrium problem are established in noncompact product of G-convex spaces. Our results improve and generalize some recent results in the literature to product of G-convex spaces.The authors thank the referees for valuable comments and suggestionsThe research of this author was supported by the National Science Foundation of China, Sichuan Education Department.The research of this author was supported by the National Science Council of the Republic of China.