42 research outputs found

    Sequential Decision Making with Untrustworthy Service Providers

    No full text
    In this paper, we deal with the sequential decision making problem of agents operating in computational economies, where there is uncertainty regarding the trustworthiness of service providers populating the environment. Specifically, we propose a generic Bayesian trust model, and formulate the optimal Bayesian solution to the exploration-exploitation problem facing the agents when repeatedly interacting with others in such environments. We then present a computationally tractable Bayesian reinforcement learning algorithm to approximate that solution by taking into account the expected value of perfect information of an agent's actions. Our algorithm is shown to dramatically outperform all previous finalists of the international Agent Reputation and Trust (ART) competition, including the winner from both years the competition has been run

    Cooperative games with overlapping coalitions

    No full text
    In the usual models of cooperative game theory, the outcome of a coalition formation process is either the grand coalition or a coalition structure that consists of disjoint coalitions. However, in many domains where coalitions are associated with tasks, an agent may be involved in executing more than one task, and thus may distribute his resources among several coalitions. To tackle such scenarios, we introduce a model for cooperative games with overlapping coalitions—or overlapping coalition formation (OCF) games. We then explore the issue of stability in this setting. In particular, we introduce a notion of the core, which generalizes the corresponding notion in the traditional (non-overlapping) scenario. Then, under some quite general conditions, we characterize the elements of the core, and show that any element of the core maximizes the social welfare. We also introduce a concept of balancedness for overlapping coalitional games, and use it to characterize coalition structures that can be extended to elements of the core. Finally, we generalize the notion of convexity to our setting, and show that under some natural assumptions convex games have a non-empty core. Moreover, we introduce two alternative notions of stability in OCF that allow a wider range of deviations, and explore the relationships among the corresponding definitions of the core, as well as the classic (non-overlapping) core and the Aubin core. We illustrate the general properties of the three cores, and also study them from a computational perspective, thus obtaining additional insights into their fundamental structure

    Pattern and Outcome of Chest Injuries at Bugando Medical Centre in Northwestern Tanzania.

    Get PDF
    Chest injuries constitute a continuing challenge to the trauma or general surgeon practicing in developing countries. This study was conducted to outline the etiological spectrum, injury patterns and short term outcome of these injuries in our setting. This was a prospective study involving chest injury patients admitted to Bugando Medical Centre over a six-month period from November 2009 to April 2010 inclusive. A total of 150 chest injury patients were studied. Males outnumbered females by a ratio of 3.8:1. Their ages ranged from 1 to 80 years (mean = 32.17 years). The majority of patients (72.7%) sustained blunt injuries. Road traffic crush was the most common cause of injuries affecting 50.7% of patients. Chest wall wounds, hemothorax and rib fractures were the most common type of injuries accounting for 30.0%, 21.3% and 20.7% respectively. Associated injuries were noted in 56.0% of patients and head/neck (33.3%) and musculoskeletal regions (26.7%) were commonly affected. The majority of patients (55.3%) were treated successfully with non-operative approach. Underwater seal drainage was performed in 39 patients (19.3%). One patient (0.7%) underwent thoracotomy due to hemopericardium. Thirty nine patients (26.0%) had complications of which wound sepsis (14.7%) and complications of long bone fractures (12.0%) were the most common complications. The mean LOS was 13.17 days and mortality rate was 3.3%. Using multivariate logistic regression analysis, associated injuries, the type of injury, trauma scores (ISS, RTS and PTS) were found to be significant predictors of the LOS (P < 0.001), whereas mortality was significantly associated with pre-morbid illness, associated injuries, trauma scores (ISS, RTS and PTS), the need for ICU admission and the presence of complications (P < 0.001). Chest injuries resulting from RTCs remain a major public health problem in this part of Tanzania. Urgent preventive measures targeting at reducing the occurrence of RTCs is necessary to reduce the incidence of chest injuries in this region

    The Complexity of Computing Minimal Unidirectional Covering Sets

    Full text link
    Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Brandt and Fischer [BF08] proved that it is NP-hard to decide whether an alternative is contained in some inclusion-minimal upward or downward covering set. For both problems, we raise this lower bound to the Theta_{2}^{p} level of the polynomial hierarchy and provide a Sigma_{2}^{p} upper bound. Relatedly, we show that a variety of other natural problems regarding minimal or minimum-size covering sets are hard or complete for either of NP, coNP, and Theta_{2}^{p}. An important consequence of our results is that neither minimal upward nor minimal downward covering sets (even when guaranteed to exist) can be computed in polynomial time unless P=NP. This sharply contrasts with Brandt and Fischer's result that minimal bidirectional covering sets (i.e., sets that are both minimal upward and minimal downward covering sets) are polynomial-time computable.Comment: 27 pages, 7 figure

    Computing optimal coalition structures in polynomial time

    Get PDF
    The optimal coalition structure determination problem is in general computationally hard. In this article, we identify some problem instances for which the space of possible coalition structures has a certain form and constructively prove that the problem is polynomial time solvable. Specifically, we consider games with an ordering over the players and introduce a distance metric for measuring the distance between any two structures. In terms of this metric, we define the property of monotonicity, meaning that coalition structures closer to the optimal, as measured by the metric, have higher value than those further away. Similarly, quasi-monotonicity means that part of the space of coalition structures is monotonic, while part of it is non-monotonic. (Quasi)-monotonicity is a property that can be satisfied by coalition games in characteristic function form and also those in partition function form. For a setting with a monotonic value function and a known player ordering, we prove that the optimal coalition structure determination problem is polynomial time solvable and devise such an algorithm using a greedy approach. We extend this algorithm to quasi-monotonic value functions and demonstrate how its time complexity improves from exponential to polynomial as the degree of monotonicity of the value function increases. We go further and consider a setting in which the value function is monotonic and an ordering over the players is known to exist but ordering itself is unknown. For this setting too, we prove that the coalition structure determination problem is polynomial time solvable and devise such an algorithm

    Use of anticoagulants and antiplatelet agents in stable outpatients with coronary artery disease and atrial fibrillation. International CLARIFY registry

    Get PDF

    Behavior and trends for Zn in Saronikos Gulf

    Get PDF
    The study of Zn in the water column of Saronikos Gulf in Greece during a two year period between 2008 and 2010 added data to the available time series of metal data for this marine area since 1985. The Saronikos Gulf, is directly influenced by the Athens metropolitan area. The operation of the Wastewater Treatment Plant of Athens situated on the small island of Psitalia, in 1995, was considered to be the turning point in the efforts of de-pollution of the gulf. Major sources of pollution for the gulf include also the port of Piraeus, with intensive navigation and shipping activities and the significant industrial activity occurring along the coast of Attica. This study of dissolved and particulate Zn gave results consistent with previous studies of the area such as the prevalence of the dissolved form of Zn and the most affected areas being the smaller most enclosed Gulf of Elefsina and Psitalia Island near the wastewater outfall. However, the concentrations of Zn were below toxic levels for marine aquatic organisms. Furthermore, a clear decrease in the Eastern part of the gulf was exhibited as well as a more subtle decrease in the gulf of Elefsina. The levels of Zn in Saronikos Gulf were found comparable to those of other Greek coastal areas

    Comparative Study of the Accumulation of Ni in Different Tissues of Mussels and Soft Clams

    Get PDF
    Two bivalves, the mussel Mytilus galloprovincialis, and the soft clam Callista chione were exposed to various Ni concentrations for a total period of 20 days, and then a depuration period of 10 days followed. Nickel accumulation in gills, mantle and the remaining body of the animals was measured after 5, 10, 15 and 20 days of exposure to Ni-contaminated seawater. The two organisms showed different behavior regarding Ni accumulation in all three tissues examined. In all concentrations, Ni accumulation increased with time in all three tissues of Mytilus galloprovincialis with gills being the most effective accumulator per dry mass. On the other hand, Callista chione showed an initial response to Ni contamination the first 5 days, followed by stabilization or even a slight decrease of Ni accumulation
    corecore