Introduction: Polycystic ovary syndrome (PCOS) is one of the most common endocrinological pathologies in women during their reproductive years with ovulatory dysfunction, abdominal obesity, hyperandrogenism and insulin resistance. The aim of the present research was to evaluate the total antioxidant capacity (TAC), total oxidant status (TOS), free testosterone, ovarian morphology and estrous cy...

Finite turn-based safety games have been used for very different problems such as the synthesis of linear temporal logic (LTL) [8], the synthesis of schedulers for computer systems running on multiprocessor platforms [4], and also for the determinisation of timed automata [3]. In these contexts, games are implicitly defined, and their size is at least exponential in the size of the input. Never...

Abstract This article considers a class of experimentation games with Lévy bandits encompassing those Bolton and Harris (1999, Econometrica, 67, 349–374) Keller, Rady, Cripps (2005, 73, 39–68). Its main result is that efficient (perfect Bayesian) equilibria exist whenever players’ payoffs have diffusion component. Hence, the trade-offs emphasized in literature do not rely on intrinsic nature ba...

background: hemophilia is a chronic bleeding disease and can interfere with daily performance of children. these children require continuous training to prevent bleeding. since children nurses play an important role in the education of sick children and their self-efficacy and the increase use of educational computer games, the use of educational games for teaching self-efficacy to children wit...

We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimising a running and final cost. We propose and analyse an algorithm that computes the value function of these games extending Dijkstra’s algorithm for shortest paths on graphs. We also show the connection of these games with numerical schemes for...

We consider sequences of games G = {G1, G2, . . .} where, for all n, Gn has the same set of players. Such sequences arise in the analysis of running time of players in games, in electronic money systems such as Bitcoin and in cryptographic protocols. Assuming that one-way functions exist, we prove that there is a sequence of 2-player zero-sumBayesian games G such that, for all n, the size of ev...