Characterization of coalitionally ordered games

Summary In the sequel we will derive sufficient and necessary conditions for the existence of certain numeric representations of simple games. In § 2 the above mentioned representation is given by a so called, coalitionally ordered function, i.e. a numeric function representing the desirability of each coalition in the class of all coalitions. Simple games which possess a c.o.f are called coalitionally ordered games. Sufficient and necessary criteria are given for a simple game to be a c.o.g. Analogously weighted majority games are characterized in § 3. The criteria to be presented are linked by properties of the desirability relation of a simple game. The concept of a desirability relation was introduced by Peleg 1978.

---

Zusammenfassung Im folgenden werden wir hinreichende und notwendige Bedingungen zur Existenz von gewissen numerischen Darstellungen einfacher Spiele (simple games) herleiten. Diese oben genannte Darstellung wird in § 2 durch eine sogenannte coalitionally ordered function, gegeben, wobei wir darunter eine numerische Funktion verstehen, die die Desirability, jeder Koalition innerhalb der Klasse aller Koalitionen beschreibt. Einfache Spiele, die eine c.o.f besitzen, werden coalitionally ordered games genannt. Es werden hinreichende und notwendige Bedingungen dafür genannt, daß ein einfaches Spiel ein c.o.g ist. Analog werden gewichtete Abstimmungsspiele (weighted majority games) in § 3 charakterisiert. Die angegebenen Kriterien werden mit Eigenschaften der sogenannten desirability relation eines einfachen Spieles in Verbindung gebracht. Das Konzept einer desirability relation wurde von Peleg 1978 verwendet.

     

Role of information in the stochastic zero-sum differential game

In this paper, a linear-quadratic Gaussian zero-sum differential game is studied. Maneuverability is defined to measure players' strength. It is shown that a more maneuverable player would prefer a more observable information system. An example is given to show that a more controllable player might not prefer more observable measurements in the stochastic environment.The research reported in this paper was made possible through support extended to the Division of Engineering and Applied Physics, Harvard University, by the US Office of Naval Research under the Joint Services Electronics Program by Contract No. N00014-75-c-0648 and by the National Science Foundation under Grant No. GK31511.     

A Framework for Evaluating Knowledge-Based Interestingness of Association Rules

In Knowledge Discovery in Databases (KDD)/Data Mining literature, interestingness measures are used to rank rules according to the interest a particular rule is expected to evoke. In this paper, we introduce an aspect of subjective interestingness called item-relatedness. Relatedness is a consequence of relationships that exist between items in a domain. Association rules containing unrelated or weakly related items are interesting since the co-occurrence of such items is unexpected. Item-Relatedness helps in ranking association rules on the basis of one kind of subjective unexpectedness. We identify three types of item-relatedness – captured in the structure of a fuzzy taxonomy (an extension of the classical concept hierarchy tree). An item-relatedness measure for describing relatedness between two items is developed by combining these three types. Efficacy of this measure is illustrated with the help of a sample taxonomy. We discuss three mechanisms for extending this measure from a two-item set to an association rule consisting of a set of more than two items. These mechanisms utilize the relatedness of item-pairs and other aspects of an association rule, namely its structure, distribution of items and item-pairs. We compare our approach with another method from recent literature.     

Averaging of Systems with Slow Variables

We justify the averaging method for systems with delay described by both slow and fast variables. The results obtained are applied to the analysis of one problem in control theory.     

0-1-sequences of Toeplitz type

Summary 0-1-sequences are constructed by successive insertion of a periodic sequence of symbols 0, 1 and hole into the holes of the sequence already constructed. Assuming that finally all holes are filled with symbols 0, 1, an almost periodic point in shift space results. Under certain conditions, it is even strictly ergodic. It is proved that the attached invariant measure has pure point spectrum, and a rather explicit expression for eigenvectors is obtained.     

A generalization of hadwiger's transversal theorem to intersecting sets

Given an ordered family of compact convex sets in the plane, if every three sets can be intersected by some directed line consistent with the ordering, then there exists a common transversal of the family. This generalizes Hadwiger's Transversal Theorem to families of compact convex sets which are not necessarily pairwise disjoint. If every six sets can be intersected by some directed line consistent with the ordering, then there exists a common transversal which is consistent with the ordering. If the family is pairwise disjoint and every four sets can be intersected by some directed line consistent with the ordering, then there exists a common transversal which is consistent with the ordering.     

Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.     

A monte carlo model for simulation of tank battles

A Monte Carlo model for simulation of company-level tank battles is described. The simulation is started with an observation phase. The probability of discovery is dependent upon properties of the terrain etc. Target selection is simulated deterministically with priority rules. Every unit belongs to one of the following states of fight: undamaged, able to shoot only, able to move only, shocked and out of action.It is possible to simulate surprise attacks and battles after a sudden contact if the units are assumed to fight from the same position during the whole battle. In a later version of the model, the units are permitted to show as much of themselves as they wish during the battle. Thus it is possible to simulate (small) changes of position, initiated by the current events.     

A combinatorial characterization of the Klein quadric

We give a combinatorial characterization of the Klein quadric in terms of its incidence structure of points and lines. As an application, we obtain a combinatorial proof of a result of Havlicek.In memoriam Giuseppe TalliniWork supported by National Research Project Strutture Geometriche, Combinatoria e loro applicazioni of the Italian Ministere dell'Università e della Ricerca Scientifica and by G.N.S.A.G.A. of C.N.R.      

Nonexistence of new order-9 projective plane with order-13 collineation

The order-9 Desarguesian projective plane and the known self-dual non-Desarguesian plane (Carmichael or Hughes plane) each have a 13-collineation displacing all points and all lines. We show that no previously undiscovered 9-plane has this property.     

Absolut stetige Maße auf lokalkompakten Halbgruppen

LetS be a locally compact semigroup. It is shown that if a measure is absolutely continuous and ifS is cancellative, then the measure concentrated on a Borel subsetB ofS (i. e. =(B.)) is also absolutely continuous. Other properties of absolutely continuous measures will be obtained. Moreover we will answer the question when absolutely continuous probability measures exist. This is the case ifS admits an invariant integral on the space of all continuous functions onS with compact support. Another result is the following: If the compact semigroupS has a connected kernel then there exist absolutely continuous probability measures if and only ifS is amenable.     

On the spectral density and asymptotic normality of weakly dependent random fields

For weakly stationary random fields, conditions on coefficients of linear dependence are given which are, respectively, sufficient for the existence of a continuous spectral density, and necessary and sufficient for the existence of a continuous positive spectral density. For strictly stationary random fields, central limit theorems are proved under the corresponding unrestricted -mixing condition and just finite or barely infinite second moments. No mixing rate is assumed.     

Chapter 1 Introduction: Extensions and new developments in DEA

The extensions, new developments and new interpretations for DEA covered in this paper include: (1) new measures of efficiency, (2) new models and (3) new ways of implementing established models with new results and interpretations presented that include treatments of congestion, returns-to-scale and mix and technical inefficiencies and measures of efficiency that can be used to reflect all pertinent properties. Previously used models, such as those used to identify allocative inefficiencies, are extended by means of assurance region approaches which are less demanding in their information requirements and underlying assumptions. New opportunities for research are identified in each section of this chapter. Sources of further developments and possible sources for further help are also suggested with references supplied to other papers that appear in this volume and which are summarily described in this introductory chapter.     

Properties of Solutions to Second Order Evolution Control Systems. II

We continue the research of the first part of the article. We mainly study codensity for the set of admissible trajectory-control pairs of a system with nonconvex constraints in the set of admissible trajectory-control pairs of the system with convexified constraints. We state necessary and sufficient conditions for the set of admissible trajectory-control pairs of a system with nonconvex constraints to be closed in the corresponding function spaces. Using an example of a control hyperbolic system, we give an interpretation of the abstract results obtained. As application we consider the minimization problem for an integral functional on solutions of a control system.     

“Solar” properties of sets in Banach spaces

In this article we consider relations between different classes of suns. A sufficient condition for a set to be a sun is given.Translated from Matematicheskie Zametki, Vol. 13, No. 6, pp. 795–805, June, 1973.     

An upper bound for SLP using first and total second moments

In 1987, J. Dulá considered the problem of finding an upper bound for the expectation of a so-called simplicial function of a random vector and used for this purpose first and total second moments. Under the same moment conditions we consider some different cases of recourse functions and demonstrate how the related moment problems can be solved by solving nonsmooth (unconstrained) optimization problems and thereafter satisfying simple linear constraint systems.     

A Nonlinear Problem Associated to the Motion of a Membrane

A nonlinear model associated to the motion of a membrane is considered as limit of a sequence of approximate models, for which a global existence and uniqueness theorem can be proved. The paper investigates the relationship between the solutions of the real and approximate models.     

Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen

Brugesser and Mani proved that the boundary-complex of a convex polytope can be shelled. This result lead to McMullen's proof of the Upper-bound-conjecture. We show that the shellability of complexes has a close connection to the theory of stellar operations. Several results on special shelling procedures and on non-shellable complexes are obtained.     

On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

Discrete Newton methods and iterated defect corrections

Summary In this paper we present a general theory for discrete Newton methods, iterated defect corrections via neighbouring problems and deferred corrections based on asymptotic expansions of the discretization error.Dedicated to Professor Dr. J. Weisinger on the occasion of his sixty-fifth birthday