Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets

In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. Rationality here means playing only strategies one believes to be best responses. This involves looking at two formal languages. One is first-order, and is used to formalise optimality conditions, like avoiding strictly dominated strategies, or playing a best response. The other is a modal fixpoint language with expressions for optimality, rationality and belief. Fixpoints are used to form expressions for common belief and for iterated elimination of non-optimal strategies.Comment: 16 pages, Proc. 11th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XI). To appea

Efficient Equilibria in Polymatrix Coordination Games

We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study $\alpha$-approximate $k$-equilibria of these games, i.e., outcomes where no group of at most $k$ players can deviate such that each member increases his payoff by at least a factor $\alpha$. We prove that for $\alpha \ge 2$ these games have the finite coalitional improvement property (and thus $\alpha$-approximate $k$-equilibria exist), while for $\alpha < 2$ this property does not hold. Further, we derive an almost tight bound of $2\alpha(n-1)/(k-1)$ on the price of anarchy, where $n$ is the number of players; in particular, it scales from unbounded for pure Nash equilibria ($k = 1)$ to $2\alpha$ for strong equilibria ($k = n$). We also settle the complexity of several problems related to the verification and existence of these equilibria. Finally, we investigate natural means to reduce the inefficiency of Nash equilibria. Most promisingly, we show that by fixing the strategies of $k$ players the price of anarchy can be reduced to $n/k$ (and this bound is tight)

Acceptability with general orderings

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general orderings, and show how they are equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together. {\bf Keywords:} termination analysis, acceptability, orderings.Comment: To appear in "Computational Logic: From Logic Programming into the Future

Specializing Interpreters using Offline Partial Deduction

We present the latest version of the Logen partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters.We show how to achieve Jones-optimality in a systematic way for several interpreters. Finally, we present and specialise a non-trivial interpreter for a small functional programming language. Experimental results are also presented, highlighting that the Logen system can be a good basis for generating compilers for high-level languages

Atomic Resonance and Scattering

Contains research objectives, summary of research and reports on four research projects.Joint Services Electronics Programs (U. S. Army, U. S. Navy, and U. S. Air Force) under Contract DAAB07-71-C-0300National Science Foundation (Grant GP-28679)National Bureau of Standards (Grant NBS2-9011)U. S. Air Force - Office of Scientific Research (Contract F44620-72-C-0057

Stability of oligosaccharides derived from lactulose during the processing of milk and apple juice

The scientific evidence on the bioactivity of oligosaccharides from lactulose has encouraged us to study their physicochemical modifications during the processing of milk and apple juice. The carbohydrate fraction with a degree of polymerization ≥3 was stable in milk heated at temperatures up to 100°C for 30 min and in apple juice heated up to 90°C for 15 min. An assessment of the Maillard reaction in heated milk pointed out a higher formation of furosine in milk with oligosaccharides from lactulose as compared to its counterpart without this ingredient, due to a higher presence of galactose. The organoleptic properties of juice with oligosaccharides from lactulose were acceptable and similar to those of apple juice with commercial galactooligosaccharides. The results presented herein demonstrate that oligosaccharides from lactulose can be used as prebiotic ingredients in a wide range of functional foods, including those intended for diabetics and lactose intolerant individuals.This work has been supported by project AGL2011-27884 from Spanish Ministerio de Economía y Competitividad.Peer Reviewe

Independence in CLP Languages

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and eciency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and eciency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sucient for ensuring correctness and eciency. Two additional issues arise. The rst is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow dierent optimizations, from parallelism to intelligent backtracking. Sucient conditions for independence which can be evaluated \a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sucient but also a necessary condition for ensuring correctness and eciency of parallel execution

Atomic Resonance and Scattering

Contains research objectives, summary of research and reports on five research projects.Joint Services Electronics Programs (U. S. Army, U. S. Navy, and U. S. Air Force) under Contract DAAB07-71-C-0300National Science Foundation (Grant GP 28679)National Bureau of Standards (Grant 1-35857

Significance Tests for Periodogram Peaks

We discuss methods currently in use for determining the significance of peaks in the periodograms of time series. We discuss some general methods for constructing significance tests, false alarm probability functions, and the role played in these by independent random variables and by empirical and theoretical cumulative distribution functions. We also discuss the concept of "independent frequencies" in periodogram analysis. We propose a practical method for estimating the significance of periodogram peaks, applicable to all time series irrespective of the spacing of the data. This method, based on Monte Carlo simulations, produces significance tests that are tailor-made for any given astronomical time series.Comment: 22 pages, 11 Encapsulated Postscript figures, AAS LaTeX v5.2 Submitted to Ap

Susceptibility to tuberculosis is associated with variants in the ASAP1 gene encoding a regulator of dendritic cell migration

Human genetic factors predispose to tuberculosis (TB). We studied 7.6 million genetic variants in 5,530 people with pulmonary TB and in 5,607 healthy controls. In the combined analysis of these subjects and the follow-up cohort (15,087 TB patients and controls altogether), we found an association between TB and variants located in introns of the ASAP1 gene on chromosome 8q24 (P = 2.6 × 10−11 for rs4733781; P = 1.0 × 10−10 for rs10956514). Dendritic cells (DCs) showed high ASAP1 expression that was reduced after Mycobacterium tuberculosis infection, and rs10956514 was associated with the level of reduction of ASAP1 expression. The ASAP1 protein is involved in actin and membrane remodeling and has been associated with podosomes. The ASAP1-depleted DCs showed impaired matrix degradation and migration. Therefore, genetically determined excessive reduction of ASAP1 expression in M. tuberculosis–infected DCs may lead to their impaired migration, suggesting a potential mechanism of predisposition to TB