975 resultados para Game strategies
Resumo:
This study aims to present the conditions related to the European Union’s involvement in the Arab Spring, as well as examine the extent of this capability-based involvement in the first months of 2011 against the background of competence disputes between institutions and inter-governmental contentions. These considerations will be the basis for conclusions on the theoretical and practical viability of the European Union’s action in the region of North Africa, in terms of both interests defined in Brussels and representation of a jointly agreed position and undertaking practical actions in the international arena. These assumptions can facilitate a new perspective for the EU’s strategic approach framework in the region of North Africa.
Resumo:
We generalize the well-known pebble game to infinite dag's, and we use this generalization to give new and shorter proofs of results in different areas of computer science (as diverse as "logic of programs" and "formal language theory"). Our applications here include a proof of a theorem due to Salomaa, asserting the existence of a context-free language with infinite index, and a proof of a theorem due to Tiuryn and Erimbetov, asserting that unbounded memory increases the power of logics of programs. The original proofs by Salomaa, Tiuryn, and Erimbetov, are fairly technical. The proofs by Tiuryn and Erimbetov also involve advanced techniques of model theory, namely, back-and-forth constructions based on a variant of Ehrenfeucht-Fraisse games. By contrast, our proofs are not only shorter, but also elementary. All we need is essentially finite induction and, in the case of the Tiuryn-Erimbetov result, the compactness and completeness of first-order logic.
Resumo:
Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.
Resumo:
In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.
Resumo:
This thesis is concentrated on the historical aspects of the elitist field sports of deer stalking and game shooting, as practiced by four Irish landed ascendancy families in the south west of Ireland. Four great estates were selected for study. Two of these were, by Irish standards, very large: the Kenmare estate of over 136,000 acres in the ownership of the Roman Catholic Earls of Kenmare, and the Herbert estate of over 44,000 acres in the ownership of the Protestant Herbert family. The other two were, in relative terms, small: the Grehan estate of c.7,500 acres in the ownership of the Roman Catholic Grehan family, and the Godfrey estate of c.5,000 acres, in the ownership of the Protestant Barons Godfrey. This mixture of contrasting estate size, owner's religions, nobleman, minor aristocrat and untitled gentry should, it is argued, yield a diversity of the field sports and lifestyles of their owners, and go some way to assess the contributions, good or bad, they have bequeathed to modern Ireland. Equally, it should help in assessing what importance, if any, applied to hunting. In this context, hunting is here used in its broadest meaning, and includes deer stalking and game shooting, as well as hunting with dogs and hounds on foot and horseback. Where a specific type of hunting is involved, it is so described; for example, fox hunting, stag hunting, hare hunting. Similarly, the term game is sometimes used in sporting literature to encompass all species of quarry killed, and can include deer, ground game (hares and rabbits), waterfowl, and various species of game birds. Where it refers to specific species, these are so described; for example grouse, pheasants, woodcork, wild duck, etc. Since two of these estates - the Kenmare and Herbert - each created a deer forest, unique in mid-19th century Ireland, they form the core study estates; the two smaller estates serve as comparative studies. And, equally unique, as these two larger estates held the only remnant population of native Irish red deer, the survival of that herd itself forms a concomitant core area of analysis. The numerary descriptions applied to these animals in popular literature are critically reassessed against prime source historical evidence, as are the so-called deer forest 'clearances'. The core period, 1840 to 1970, is selected as the seminal period, spanning 130 years, from the creation of the deer forests to when a fundamental change in policy and administration was introduced by the state. Comparison is made with similar estates elsewhere, in Britain and especially in Scotland. Their influence on the Irish methods and style of hunting is historically examined.
Resumo:
Urban areas in many developing countries are expanding rapidly by incorporating nearby subsistence farming communities. This has a direct effect on the consumption and production behaviours of the farm households but empirical evidence is sparse. This thesis investigated the effects of rapid urbanization and the associated policies on welfare of subsistence farm households in peri-urban areas using a panel dataset from Tigray, Ethiopia. The study revealed a number of important issues emerging with the rapid urban expansion. Firstly, private asset holdings and consumption expenditure of farm households, that have been incorporated into urban administration, has decreased. Secondly, factors that influence the farm households’ welfare and vulnerability depend on the administration they belong to, urban or rural. Gender and literacy of the household head have significant roles for the urban farm households to fall back into and/or move out of poverty. However, livestock holding and share of farm income are the most important factors for rural households. Thirdly, the study discloses that farming continues to be important source of income and income diversification is the principal strategy. Participation in nonfarm employment is less for farm households in urban than rural areas. Adult labour, size of the local market and past experience in the nonfarm sector improves the likelihood of engaging in skilled nonfarm employment opportunities. But money, given as compensation for the land taken away, is not crucial for the household to engage in better paying nonfarm employments. Production behaviour of the better-off farm households is the same, regardless of the administration they belong to. However, the urban poor participate less in nonfarm employment compared to the rural poor. These findings signify the gradual development of urban-induced poverty in peri-urban areas. In the case of labour poor households, introducing urban safety net programmes could improve asset productivity and provide further protection.
Resumo:
INTRODUCTION: Potentially inappropriate prescribing (PIP) is a major contributor to adverse drug reactions and overall increased healthcare costs. The aim of this thesis was to identify, develop and implement strategies with the potential to prevent PIP and ADRs in older patients. METHODS: A systematic review of the qualitative literature (Meta-synthesis); A qualitative study in Irish hospitals; A randomised controlled trial (RCT) to assess the impact of an online educational module on doctors’ prescribing knowledge and confidence; Exploration of the potential for a frailty index score to enable doctors identify patients at increased risk of PIP and ADRs; Exploration of the potential for the SHiM tool to enable doctors to optimise prescribing for older patients. RESULTS: The meta-synthesis identified four key concepts: (i) Desire to please the patient; (ii) Feeling of being forced to prescribe; (iii) Tension between experience and guidelines; (iv) Prescriber fear. Similar themes also emerged from the qualitative study. In the RCT, the online educational module resulted in a highly significant 22% difference in test scores between intervention and control groups. The studies exploring the frailty index score showed a significant positive relationship between a patient’s frailty status and their likelihood of experiencing PIP/ADRs. Patients above a frailty threshold of 0.16 were at least twice as likely to experience PIP/ADRs. SHiM was found to be a useful tool in terms of reconciling patients’ medications. However, the evidence for it being capable of preventing clinically relevant adverse events was poor. CONCLUSION:Qualitative research in this thesis has proposed novel theories relating to the causative factors of PIP in older patients. In doing so, it has identified several areas for intervention and laid down a road map for future research.
Resumo:
info:eu-repo/semantics/published
Resumo:
Gemstone Team ILL (Interactive Language Learning)
Resumo:
We conduct the first empirical investigation of common-pool resource users' dynamic and strategic behavior at the micro level using real-world data. Fishermen's strategies in a fully dynamic game account for latent resource dynamics and other players' actions, revealing the profit structure of the fishery. We compare the fishermen's actual and socially optimal exploitation paths under a time-specific vessel allocation policy and find a sizable dynamic externality. Individual fishermen respond to other users by exerting effort above the optimal level early in the season. Congestion is costly instantaneously but is beneficial in the long run because it partially offsets dynamic inefficiencies.
Resumo:
The effectiveness of vaccinating males against the human papillomavirus (HPV) remains a controversial subject. Many existing studies conclude that increasing female coverage is more effective than diverting resources into male vaccination. Recently, several empirical studies on HPV immunization have been published, providing evidence of the fact that marginal vaccination costs increase with coverage. In this study, we use a stochastic agent-based modeling framework to revisit the male vaccination debate in light of these new findings. Within this framework, we assess the impact of coverage-dependent marginal costs of vaccine distribution on optimal immunization strategies against HPV. Focusing on the two scenarios of ongoing and new vaccination programs, we analyze different resource allocation policies and their effects on overall disease burden. Our results suggest that if the costs associated with vaccinating males are relatively close to those associated with vaccinating females, then coverage-dependent, increasing marginal costs may favor vaccination strategies that entail immunization of both genders. In particular, this study emphasizes the necessity for further empirical research on the nature of coverage-dependent vaccination costs.
Resumo:
The rivalry between the men's basketball teams of Duke University and the University of North Carolina-Chapel Hill (UNC) is one of the most storied traditions in college sports. A subculture of students at each university form social bonds with fellow fans, develop expertise in college basketball rules, team statistics, and individual players, and self-identify as a member of a fan group. The present study capitalized on the high personal investment of these fans and the strong affective tenor of a Duke-UNC basketball game to examine the neural correlates of emotional memory retrieval for a complex sporting event. Male fans watched a competitive, archived game in a social setting. During a subsequent functional magnetic resonance imaging session, participants viewed video clips depicting individual plays of the game that ended with the ball being released toward the basket. For each play, participants recalled whether or not the shot went into the basket. Hemodynamic signal changes time locked to correct memory decisions were analyzed as a function of emotional intensity and valence, according to the fan's perspective. Results showed intensity-modulated retrieval activity in midline cortical structures, sensorimotor cortex, the striatum, and the medial temporal lobe, including the amygdala. Positively valent memories specifically recruited processing in dorsal frontoparietal regions, and additional activity in the insula and medial temporal lobe for positively valent shots recalled with high confidence. This novel paradigm reveals how brain regions implicated in emotion, memory retrieval, visuomotor imagery, and social cognition contribute to the recollection of specific plays in the mind of a sports fan.
Resumo:
Scheduling a set of jobs over a collection of machines to optimize a certain quality-of-service measure is one of the most important research topics in both computer science theory and practice. In this thesis, we design algorithms that optimize {\em flow-time} (or delay) of jobs for scheduling problems that arise in a wide range of applications. We consider the classical model of unrelated machine scheduling and resolve several long standing open problems; we introduce new models that capture the novel algorithmic challenges in scheduling jobs in data centers or large clusters; we study the effect of selfish behavior in distributed and decentralized environments; we design algorithms that strive to balance the energy consumption and performance.
The technically interesting aspect of our work is the surprising connections we establish between approximation and online algorithms, economics, game theory, and queuing theory. It is the interplay of ideas from these different areas that lies at the heart of most of the algorithms presented in this thesis.
The main contributions of the thesis can be placed in one of the following categories.
1. Classical Unrelated Machine Scheduling: We give the first polygorithmic approximation algorithms for minimizing the average flow-time and minimizing the maximum flow-time in the offline setting. In the online and non-clairvoyant setting, we design the first non-clairvoyant algorithm for minimizing the weighted flow-time in the resource augmentation model. Our work introduces iterated rounding technique for the offline flow-time optimization, and gives the first framework to analyze non-clairvoyant algorithms for unrelated machines.
2. Polytope Scheduling Problem: To capture the multidimensional nature of the scheduling problems that arise in practice, we introduce Polytope Scheduling Problem (\psp). The \psp problem generalizes almost all classical scheduling models, and also captures hitherto unstudied scheduling problems such as routing multi-commodity flows, routing multicast (video-on-demand) trees, and multi-dimensional resource allocation. We design several competitive algorithms for the \psp problem and its variants for the objectives of minimizing the flow-time and completion time. Our work establishes many interesting connections between scheduling and market equilibrium concepts, fairness and non-clairvoyant scheduling, and queuing theoretic notion of stability and resource augmentation analysis.
3. Energy Efficient Scheduling: We give the first non-clairvoyant algorithm for minimizing the total flow-time + energy in the online and resource augmentation model for the most general setting of unrelated machines.
4. Selfish Scheduling: We study the effect of selfish behavior in scheduling and routing problems. We define a fairness index for scheduling policies called {\em bounded stretch}, and show that for the objective of minimizing the average (weighted) completion time, policies with small stretch lead to equilibrium outcomes with small price of anarchy. Our work gives the first linear/ convex programming duality based framework to bound the price of anarchy for general equilibrium concepts such as coarse correlated equilibrium.
Resumo:
Adult body size is controlled by the mechanisms that stop growth when a species-characteristic size has been reached. The mechanisms by which size is sensed and by which this information is transduced to the growth regulating system are beginning to be understood in a few species of insects. Two rather different strategies for control have been discovered; one favors large body size and the other favors rapid development.