Incentive Stackelberg Mean-payoff Games

We introduce and study incentive equilibria for multi-player meanpayoff games. Incentive equilibria generalise well-studied solution concepts such as Nash equilibria and leader equilibria (also known as Stackelberg equilibria). Recall that a strategy profile is a Nash equilibrium if no player can improve his payoff by changing his strategy unilaterally. In the setting of incentive and leader equilibria, there is a distinguished player called the leader who can assign strategies to all other players, referred to as her followers. A strategy profile is a leader strategy profile if no player, except for the leader, can improve his payoff by changing his strategy unilaterally, and a leader equilibrium is a leader strategy profile with a maximal return for the leader. In the proposed case of incentive equilibria, the leader can additionally influence the behaviour of her followers by transferring parts of her payoff to her followers. The ability to incentivise her followers provides the leader with more freedom in selecting strategy profiles, and we show that this can indeed improve the payoff for the leader in such games. The key fundamental result of the paper is the existence of incentive equilibria in mean-payoff games. We further show that the decision problem related to constructing incentive equilibria is NP-complete. On a positive note, we show that, when the number of players is fixed, the complexity of the problem falls in the same class as two-player mean-payoff games. We also present an implementation of the proposed algorithms, and discuss experimental results that demonstrate the feasibility of the analysis of medium sized games.Comment: 15 pages, references, appendix, 5 figure

Symmetric Strategy Improvement

Symmetry is inherent in the definition of most of the two-player zero-sum games, including parity, mean-payoff, and discounted-payoff games. It is therefore quite surprising that no symmetric analysis techniques for these games exist. We develop a novel symmetric strategy improvement algorithm where, in each iteration, the strategies of both players are improved simultaneously. We show that symmetric strategy improvement defies Friedmann's traps, which shook the belief in the potential of classic strategy improvement to be polynomial

How Differences in Perceptions of Own and Team Performance Impact Trust and Job Satisfaction in Virtual Teams

Employees frequently engage in social comparison processes and have a tendency to perceive their own performance as superior compared to that of their peers. We expect this to be particularly salient in virtual teams where employees receive few cues upon which the comparison with their team members can be based. With reliance on social exchange theory, we propose that such ‘perceived overperformance’ has negative effects on individual job satisfaction which are mediated by individual trust in team. We confirm this with a sample of field-service employees (753 employees, 57 virtual teams) using structural equation modelling and bootstrapping. We corroborated our findings in focus groups which suggest the need for performance indicators that are easily and comprehended by employees to maintain trust and satisfaction

TGF-β2 dictates disseminated tumour cell fate in target organs through TGF-β-RIII and p38α/β signalling

In patients, non-proliferative disseminated tumour cells (DTCs) can persist in the bone marrow (BM) while other organs (such as lung) present growing metastasis. This suggested that the BM might be a metastasis ‘restrictive soil’ by encoding dormancy-inducing cues in DTCs. Here we show in a head and neck squamous cell carcinoma (HNSCC) model that strong and specific transforming growth factor-β2 (TGF-β2) signalling in the BM activates the MAPK p38α/β, inducing an (ERK/p38)low signalling ratio. This results in induction of DEC2/SHARP1 and p27, downregulation of cyclin-dependent kinase 4 (CDK4) and dormancy of malignant DTCs. TGF-β2-induced dormancy required TGF-β receptor-I (TGF-β-RI), TGF-β-RIII and SMAD1/5 activation to induce p27. In lungs, a metastasis ‘permissive soil’ with low TGF-β2 levels, DTC dormancy was short-lived and followed by metastatic growth. Importantly, systemic inhibition of TGF-β-RI or p38α/β activities awakened dormant DTCs, fuelling multi-organ metastasis. Our work reveals a ‘seed and soil’ mechanism where TGF-β2 and TGF-β-RIII signalling through p38α/β regulates DTC dormancy and defines restrictive (BM) and permissive (lung) microenvironments for HNSCC metastasis.Fil: Bragado, Paloma. Mount Sinai School of Medicine. Tisch Cancer Institute; Estados UnidosFil: Estrada, Yeriel. Mount Sinai School of Medicine. Tisch Cancer Institute; Estados UnidosFil: Parikh, Falguni. Mount Sinai School of Medicine. Tisch Cancer Institute; Estados UnidosFil: Krause, Sarah. University Hospital of Schleswig-Holstein; AlemaniaFil: Capobianco, Carla Sabrina. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología. Laboratorio de Oncología Molecular; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Farina, Hernán Gabriel. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología. Laboratorio de Oncología Molecular; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Schewe, Denis M.. Mount Sinai School of Medicine. Tisch Cancer Institute; Estados UnidosFil: Aguirre Ghiso, Julio A.. Mount Sinai School of Medicine. Tisch Cancer Institute; Estados Unido

Sparse Positional Strategies for Safety Games

We consider the problem of obtaining sparse positional strategies for safety games. Such games are a commonly used model in many formal methods, as they make the interaction of a system with its environment explicit. Often, a winning strategy for one of the players is used as a certificate or as an artefact for further processing in the application. Small such certificates, i.e., strategies that can be written down very compactly, are typically preferred. For safety games, we only need to consider positional strategies. These map game positions of a player onto a move that is to be taken by the player whenever the play enters that position. For representing positional strategies compactly, a common goal is to minimize the number of positions for which a winning player's move needs to be defined such that the game is still won by the same player, without visiting a position with an undefined next move. We call winning strategies in which the next move is defined for few of the player's positions sparse. Unfortunately, even roughly approximating the density of the sparsest strategy for a safety game has been shown to be NP-hard. Thus, to obtain sparse strategies in practice, one either has to apply some heuristics, or use some exhaustive search technique, like ILP (integer linear programming) solving. In this paper, we perform a comparative study of currently available methods to obtain sparse winning strategies for the safety player in safety games. We consider techniques from common knowledge, such as using ILP or SAT (satisfiability) solving, and a novel technique based on iterative linear programming. The results of this paper tell us if current techniques are already scalable enough for practical use.Comment: In Proceedings SYNT 2012, arXiv:1207.055

Numerical and experimental verification of a theoretical model of ripple formation in ice growth under supercooled water film flow

Little is known about morphological instability of a solidification front during the crystal growth of a thin film of flowing supercooled liquid with a free surface: for example, the ring-like ripples on the surface of icicles. The length scale of the ripples is nearly 1 cm. Two theoretical models for the ripple formation mechanism have been proposed. However, these models lead to quite different results because of differences in the boundary conditions at the solid-liquid interface and liquid-air surface. The validity of the assumption used in the two models is numerically investigated and some of the theoretical predictions are compared with experiments.Comment: 30 pages, 9 figure

Persistent clinical efficacy and safety of anti-tumour necrosis factor \textgreeka therapy with infliximab in patients with ankylosing spondylitis over 5 years: evidence for different types of response

Background: There is insufficient evidence for the long-term efficacy and safety of anti-tumour necrosis factor therapy in patients with ankylosing spondylitis (AS). This is the first report on the treatment with infliximab over 5 years.Methods: As part of a multicentre randomised trial, 69 patients with active AS at baseline (BL) have been continuously treated with infliximab (5 mg/kg i.v. every 6 weeks)---except for a short discontinuation after 3 years (FU1). The primary outcome of this extension was remission according to the ASsessment in Ankylosing Spondylitis (ASAS) criteria at the end of year 5 of the study (FU2).Results: Of the 43 patients who completed year 3, 42 agreed to continue, 38 of which (90.5%) finished year 5 (55% of 69 initially). Partial clinical remission was achieved in 13 of 38 patients (34.2%) at FU1 and FU2. At FU2, the mean Bath Ankylosing Spondylitis Disease Activity Index (BASDAI) was 2.5±1.9 (BL:6.4, FU1:2.5). BASDAI values <4 were seen in 79% of patients at both, FU1 and FU2. ASAS 20% and 40% responses were seen in 32 (84%) and 24 (63%) patients at FU2, respectively. Most patients classified as non-responders at FU2 were part-time responders, as all but one patient achieved an ASAS 20% response at least once within the last 2 years. Three types of responders were identified. No major side effects occurred during years 4 and 5 of infliximab therapy.Conclusions: Infliximab is safe and efficacious in AS patients over 5 years. The majority of the patients remained on treatment and had rather persistent levels of low disease activity. Different response types could be identified

Robustness of the European power grids under intentional attack

The power grid defines one of the most important technological networks of our times and sustains our complex society. It has evolved for more than a century into an extremely huge and seemingly robust and well understood system. But it becomes extremely fragile as well, when unexpected, usually minimal, failures turn into unknown dynamical behaviours leading, for example, to sudden and massive blackouts. Here we explore the fragility of the European power grid under the effect of selective node removal. A mean field analysis of fragility against attacks is presented together with the observed patterns. Deviations from the theoretical conditions for network percolation (and fragmentation) under attacks are analysed and correlated with non topological reliability measures.Comment: 7 pages, 4 figure

Local Strategy Improvement for Parity Game Solving

The problem of solving a parity game is at the core of many problems in model checking, satisfiability checking and program synthesis. Some of the best algorithms for solving parity game are strategy improvement algorithms. These are global in nature since they require the entire parity game to be present at the beginning. This is a distinct disadvantage because in many applications one only needs to know which winning region a particular node belongs to, and a witnessing winning strategy may cover only a fractional part of the entire game graph. We present a local strategy improvement algorithm which explores the game graph on-the-fly whilst performing the improvement steps. We also compare it empirically with existing global strategy improvement algorithms and the currently only other local algorithm for solving parity games. It turns out that local strategy improvement can outperform these others by several orders of magnitude