11,443 research outputs found

    A comparative study of game theoretic and evolutionary models for software agents

    No full text
    Most of the existing work in the study of bargaining behaviour uses techniques from game theory. Game theoretic models for bargaining assume that players are perfectly rational and that this rationality in common knowledge. However, the perfect rationality assumption does not hold for real-life bargaining scenarios with humans as players, since results from experimental economics show that humans find their way to the best strategy through trial and error, and not typically by means of rational deliberation. Such players are said to be boundedly rational. In playing a game against an opponent with bounded rationality, the most effective strategy of a player is not the equilibrium strategy but the one that is the best reply to the opponent's strategy. The evolutionary model provides a means for studying the bargaining behaviour of boundedly rational players. This paper provides a comprehensive comparison of the game theoretic and evolutionary approaches to bargaining by examining their assumptions, goals, and limitations. We then study the implications of these differences from the perspective of the software agent developer

    An anytime approximation method for the inverse Shapley value problem

    No full text
    Coalition formation is the process of bringing together two or more agents so as to achieve goals that individuals on their own cannot, or to achieve them more efficiently. Typically, in such situations, the agents have conflicting preferences over the set of possible joint goals. Thus, before the agents realize the benefits of cooperation, they must find a way of resolving these conflicts and reaching a consensus. In this context, cooperative game theory offers the voting game as a mechanism for agents to reach a consensus. It also offers the Shapley value as a way of measuring the influence or power a player has in determining the outcome of a voting game. Given this, the designer of a voting game wants to construct a game such that a players Shapley value is equal to some desired value. This is called the inverse Shapley value problem. Solving this problem is necessary, for instance, to ensure fairness in the players voting powers. However, from a computational perspective, finding a players Shapley value for a given game is #p-complete. Consequently, the problem of verifying that a voting game does indeed yield the required powers to the agents is also #P-complete. Therefore, in order to overcome this problem we present a computationally efficient approximation algorithm for solving the inverse problem. This method is based on the technique of successive approximations; it starts with some initial approximate solution and iteratively updates it such that after each iteration, the approximate gets closer to the required solution. This is an anytime algorithm and has time complexity polynomial in the number of players. We also analyze the performance of this method in terms of its approximation error and the rate of convergence of an initial solution to the required one. Specifically, we show that the former decreases after each iteration, and that the latter increases with the number of players and also with the initial approximation error. Copyright © 2008, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaarnas.org). All rights reserved

    Polyhexamethylene Biguanide and Nadifloxacin Self-Assembled Nanoparticles: Antimicrobial Effects against Intracellular Methicillin-Resistant Staphylococcus aureus

    Get PDF
    The treatment of skin and soft tissue infections caused by methicillin-resistant Staphylococcus aureus (MRSA) remains a challenge, partly due to localization of the bacteria inside the host’s cells, where antimicrobial penetration and efficacy is limited. We formulated the cationic polymer polyhexamethylene biguanide (PHMB) with the topical antibiotic nadifloxacin and tested the activities against intracellular MRSA in infected keratinocytes. The PHMB/nadifloxacin nanoparticles displayed a size of 291.3 ± 89.6 nm, polydispersity index of 0.35 ± 0.04, zeta potential of +20.2 ± 4.8 mV, and drug encapsulation efficiency of 58.25 ± 3.4%. The nanoparticles killed intracellular MRSA, and relative to free polymer or drugs used separately or together, the nanoparticles displayed reduced toxicity and improved host cell recovery. Together, these findings show that PHMB/nadifloxacin nanoparticles are effective against intracellular bacteria and could be further developed for the treatment of skin and soft tissue infections

    Tied factor analysis for face recognition across large pose differences

    Get PDF
    Face recognition algorithms perform very unreliably when the pose of the probe face is different from the gallery face: typical feature vectors vary more with pose than with identity. We propose a generative model that creates a one-to-many mapping from an idealized “identity” space to the observed data space. In identity space, the representation for each individual does not vary with pose. We model the measured feature vector as being generated by a pose-contingent linear transformation of the identity variable in the presence of Gaussian noise. We term this model “tied” factor analysis. The choice of linear transformation (factors) depends on the pose, but the loadings are constant (tied) for a given individual. We use the EM algorithm to estimate the linear transformations and the noise parameters from training data. We propose a probabilistic distance metric that allows a full posterior over possible matches to be established. We introduce a novel feature extraction process and investigate recognition performance by using the FERET, XM2VTS, and PIE databases. Recognition performance compares favorably with contemporary approaches

    On efficient procedures for multi-issue negotiation

    No full text
    This paper studies bilateral, multi-issue negotiation between self-interested agents with deadlines. There are a number of procedures for negotiating the issues and each of these gives a different outcome. Thus, a key problem is to decide which one to use. Given this, we study the three main alternatives: the package deal, the simultaneous procedure, and the sequential procedure. First, we determine equilibria for the case where each agent is uncertain about its opponent’s deadline. We then compare the outcomes for these procedures and determine the one that is optimal (in this case, the package deal is optimal for each party). We then compare the procedures in terms of their time complexity, the uniqueness and Pareto optimality of their solutions, and their time of agreement

    Multilevel Analysis of Trachomatous Trichiasis and Corneal Opacity in Nigeria : The Role of Environmental and Climatic Risk Factors on the Distribution of Disease.

    Get PDF
    Funding: Jennifer L Smith was supported by the International Trachoma Initiative through a grant from the Bill and Melinda Gates Foundation. Anthony Solomon is a Wellcome Trust Intermediate Clinical Fellow (098521). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.Peer reviewedPublisher PD
    corecore