Query Complexity of Approximate Equilibria in Anonymous Games

We study the computation of equilibria of anonymous games, via algorithms that may proceed via a sequence of adaptive queries to the game's payoff function, assumed to be unknown initially. The general topic we consider is \emph{query complexity}, that is, how many queries are necessary or sufficient to compute an exact or approximate Nash equilibrium. We show that exact equilibria cannot be found via query-efficient algorithms. We also give an example of a 2-strategy, 3-player anonymous game that does not have any exact Nash equilibrium in rational numbers. However, more positive query-complexity bounds are attainable if either further symmetries of the utility functions are assumed or we focus on approximate equilibria. We investigate four sub-classes of anonymous games previously considered by \cite{bfh09, dp14}. Our main result is a new randomized query-efficient algorithm that finds a $O(n^{-1/4})$-approximate Nash equilibrium querying $\tilde{O}(n^{3/2})$ payoffs and runs in time $\tilde{O}(n^{3/2})$. This improves on the running time of pre-existing algorithms for approximate equilibria of anonymous games, and is the first one to obtain an inverse polynomial approximation in poly-time. We also show how this can be utilized as an efficient polynomial-time approximation scheme (PTAS). Furthermore, we prove that $\Omega(n \log{n})$ payoffs must be queried in order to find any $\epsilon$-well-supported Nash equilibrium, even by randomized algorithms

The Spectrum of the Loop Transfer Matrix on Finite Lattice

We consider the model of random surfaces with extrinsic curvature term embedded into 3d Euclidean lattice $Z^3$. On a 3d Euclidean lattice it has equivalent representation in terms of transfer matrix $K(Q_{i},Q_{f})$, which describes the propagation of loops $Q$. We study the spectrum of the transfer matrix $K(Q_{i},Q_{f})$ on finite dimensional lattices. The renormalisation group technique is used to investigate phase structure of the model and its critical behaviour.Comment: 10 pages, 5 figures, Latex, psfi

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In particular, we prove that the following problem is undecidable: Given a game G, does there exist a pure-strategy Nash equilibrium of G where player 0 wins with probability 1. Moreover, this problem remains undecidable if it is restricted to strategies with (unbounded) finite memory. However, if mixed strategies are allowed, decidability remains an open problem. One way to obtain a provably decidable variant of the problem is restricting the strategies to be positional or stationary. For the complexity of these two problems, we obtain a common lower bound of NP and upper bounds of NP and PSPACE respectively.Comment: 23 pages; revised versio

Decision Problems for Nash Equilibria in Stochastic Games

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we single out several decidable restrictions of the problem. First, restricting the search space to stationary, or pure stationary, equilibria results in problems that are typically contained in PSPACE and NP, respectively. Second, we show that the existence of an equilibrium with a binary payoff (i.e. an equilibrium where each player either wins or loses with probability 1) is decidable. We also establish that the existence of a Nash equilibrium with a certain binary payoff entails the existence of an equilibrium with the same payoff in pure, finite-state strategies.Comment: 22 pages, revised versio

Efficiency in Multi-objective Games

In a multi-objective game, each agent individually evaluates each overall action-profile on multiple objectives. I generalize the price of anarchy to multi-objective games and provide a polynomial-time algorithm to assess it. This work asserts that policies on tobacco promote a higher economic efficiency

Limited sampling estimates of epigallocatechin gallate exposures in cirrhotic and noncirrhotic patients with hepatitis C after single oral doses of green tea extract.

BACKGROUND: Epigallocatechin-3-gallate (EGCG) has antiangiogenic, antioxidant, and antifibrotic properties that may have therapeutic potential for the treatment of cirrhosis induced by hepatitis C virus (HCV). However, cirrhosis might affect EGCG disposition and augment its reported dose-dependent hepatotoxic potential. OBJECTIVE: The safety, tolerability, and disposition of a single oral dose of EGCG in cirrhotic patients with HCV were examined in an exploratory fashion. METHODS: Eleven patients with hepatitis C and detectable viremia were enrolled. Four had Child-Pugh (CP) class A cirrhosis, 4 had Child-Pugh class B cirrhosis, and 3 were noncirrhotic. After a single oral dose of green tea extract 400 mg containing 94% pure EGCG, blood for EGCG levels and safety parameters was ascertained at 2, 4, and 10 hours. RESULTS: C(max) and AUC to EGCG overlapped among the 3 groups, which suggests that the disposition of EGCG was not significantly altered in these patients with cirrhosis. CONCLUSIONS: A single 400-mg oral dose of EGCG was safe and well tolerated by all of the patients in the study. These results provide guidance for the continued investigation of the long-term safety and antitumor potential of EGCG in cirrhotic patients with HCV

The impact of temperature changes on summer time ozone and its precursors in the Eastern Mediterranean

Changes in temperature due to variability in meteorology and climate change are expected to significantly impact atmospheric composition. The Mediterranean is a climate sensitive region and includes megacities like Istanbul and large urban agglomerations such as Athens. The effect of temperature changes on gaseous air pollutant levels and the atmospheric processes that are controlling them in the Eastern Mediterranean are here investigated. The WRF/CMAQ mesoscale modeling system is used, coupled with the MEGAN model for the processing of biogenic volatile organic compound emissions. A set of temperature perturbations (spanning from 1 to 5 K) is applied on a base case simulation corresponding to July 2004. The results indicate that the Eastern Mediterranean basin acts as a reservoir of pollutants and their precursor emissions from large urban agglomerations. During summer, chemistry is a major sink at these urban areas near the surface, and a minor contributor at downwind areas. On average, the atmospheric processes are more effective within the first 1000 m above ground. Temperature increases lead to increases in biogenic emissions by 9±3% K<sup>−1</sup>. Ozone mixing ratios increase almost linearly with the increases in ambient temperatures by 1±0.1 ppb O<sub>3</sub> K<sup>−1</sup> for all studied urban and receptor stations except for Istanbul, where a 0.4±0.1 ppb O<sub>3</sub> K<sup>−1</sup> increase is calculated, which is about half of the domain-averaged increase of 0.9±0.1 ppb O<sub>3</sub> K<sup>−1</sup>. The computed changes in atmospheric processes are also linearly related with temperature changes

Alignment-Free Phylogenetic Reconstruction

14th Annual International Conference, RECOMB 2010, Lisbon, Portugal, April 25-28, 2010. ProceedingsWe introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions (or indels). Given appropriate assumptions, our algorithm requires sequence lengths growing polynomially in the number of leaf taxa. Our techniques are distance-based and largely bypass the problem of multiple alignment