2,272 research outputs found

    Correlated Equilibria of Classical Strategic Games with Quantum Signals

    Full text link
    Correlated equilibria are sometimes more efficient than the Nash equilibria of a game without signals. We investigate whether the availability of quantum signals in the context of a classical strategic game may allow the players to achieve even better efficiency than in any correlated equilibrium with classical signals, and find the answer to be positive.Comment: 8 pages, LaTe

    Creation of ventricular septal defects on the beating heart in a new pig model

    Get PDF
    Background/ Aims: So far, surgical and interventional therapies for muscular ventricular septal defects ( mVSDs) beyond the moderator band have had their limitations. Thus, alternative therapeutic strategies should be developed. We present a new animal model for the evaluation of such strategies. Methods: In a pig model ( n = 9), anterolateral thoracotomy was performed for exposure of the left ventricle. mVSDs were created under two- and three- dimensional echocardiography with a 7.5- mm sharp punch instrument, which was forwarded via a left ventricular puncture without extracorporeal circulation. Results: Creation of mVSDs was successful in all animals ( n = 9) confirmed by echocardiography, hemodynamic measurements and autopsy. The defects were located in the midmuscular ( n = 4), apical ( n = 1), inlet ( n = 2) and anterior part ( n = 2) of the muscular septum. All animals were hemodynamically stable for further procedures. The diameter and shunt volume of the mVSDs were 4.8 - 7.3 mm ( mean: 5.9 mm) and 12.9 - 41.3% ( mean: 22.1%), respectively. Autopsy confirmed in all animals the creation of a substantial defect. Conclusion: The described new technique for creation of an mVSD on the beating heart in a pig model is suitable for the evaluation of new therapeutic strategies for mVSD closure. Copyright (C) 2008 S. Karger AG, Basel

    Algorithmic Bayesian Persuasion

    Full text link
    Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in the US. This paper examines persuasion through a computational lens, focusing on what is perhaps the most basic and fundamental model in this space: the celebrated Bayesian persuasion model of Kamenica and Gentzkow. Here there are two players, a sender and a receiver. The receiver must take one of a number of actions with a-priori unknown payoff, and the sender has access to additional information regarding the payoffs. The sender can commit to revealing a noisy signal regarding the realization of the payoffs of various actions, and would like to do so as to maximize her own payoff assuming a perfectly rational receiver. We examine the sender's optimization task in three of the most natural input models for this problem, and essentially pin down its computational complexity in each. When the payoff distributions of the different actions are i.i.d. and given explicitly, we exhibit a polynomial-time (exact) algorithm, and a "simple" (1−1/e)(1-1/e)-approximation algorithm. Our optimal scheme for the i.i.d. setting involves an analogy to auction theory, and makes use of Border's characterization of the space of reduced-forms for single-item auctions. When action payoffs are independent but non-identical with marginal distributions given explicitly, we show that it is #P-hard to compute the optimal expected sender utility. Finally, we consider a general (possibly correlated) joint distribution of action payoffs presented by a black box sampling oracle, and exhibit a fully polynomial-time approximation scheme (FPTAS) with a bi-criteria guarantee. We show that this result is the best possible in the black-box model for information-theoretic reasons

    Anharmonicities of giant dipole excitations

    Get PDF
    The role of anharmonic effects on the excitation of the double giant dipole resonance is investigated in a simple macroscopic model.Perturbation theory is used to find energies and wave functions of the anharmonic ascillator.The cross sections for the electromagnetic excitation of the one- and two-phonon giant dipole resonances in energetic heavy-ion collisions are then evaluated through a semiclassical coupled-channel calculation.It is argued that the variations of the strength of the anharmonic potential should be combined with appropriate changes in the oscillator frequency,in order to keep the giant dipole resonance energy consistent with the experimental value.When this is taken into account,the effects of anharmonicities on the double giant dipole resonance excitation probabilities are small and cannot account for the well-known discrepancy between theory and experiment

    Efficient Equilibria in Polymatrix Coordination Games

    Get PDF
    We consider polymatrix coordination games with individual preferences where every player corresponds to a node in a graph who plays with each neighbor a separate bimatrix game with non-negative symmetric payoffs. In this paper, we study α\alpha-approximate kk-equilibria of these games, i.e., outcomes where no group of at most kk players can deviate such that each member increases his payoff by at least a factor α\alpha. We prove that for α≥2\alpha \ge 2 these games have the finite coalitional improvement property (and thus α\alpha-approximate kk-equilibria exist), while for α<2\alpha < 2 this property does not hold. Further, we derive an almost tight bound of 2α(n−1)/(k−1)2\alpha(n-1)/(k-1) on the price of anarchy, where nn is the number of players; in particular, it scales from unbounded for pure Nash equilibria (k=1)k = 1) to 2α2\alpha for strong equilibria (k=nk = n). We also settle the complexity of several problems related to the verification and existence of these equilibria. Finally, we investigate natural means to reduce the inefficiency of Nash equilibria. Most promisingly, we show that by fixing the strategies of kk players the price of anarchy can be reduced to n/kn/k (and this bound is tight)

    Recent Developments in NeuLAND Simulations

    Get PDF

    Simulation studies of improved sounding systems

    Get PDF
    Two instrument designs for indirect satellite sounding of the atmosphere in the infrared are represented by the High Resolution Infra-Red Sounder, Model 2 (HIRS-2) and by the Advanced Meteorological Temperature Sounder (AMTS). The relative capabilities of the two instruments were tested by simulating satellite measurements from a group of temperature soundings, allowing the two participants to retrieve the temperature profiles from the simulated data, and comparing the results with the original temperature profiles. Four data sets were produced from radiosondes data extrapolated to a suitable altitude, representing continents and oceans, between 30S and 30N. From the information available, temperature profiles were retrieved by two different methods, statistical regression and inversion of the radiative transfer equation. Results show the consequence of greater spectral purity, concomitant increase in the number of spectral intervals, and the better spatial resolution in partly clouded areas. At the same time, the limitation of the HIRS-2 without its companion instrument leads to some results which should be ignored in comparing the two instruments. A clear superiority of AMTS results is shown

    Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets

    Full text link
    In the context of strategic games, we provide an axiomatic proof of the statement Common knowledge of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. Rationality here means playing only strategies one believes to be best responses. This involves looking at two formal languages. One is first-order, and is used to formalise optimality conditions, like avoiding strictly dominated strategies, or playing a best response. The other is a modal fixpoint language with expressions for optimality, rationality and belief. Fixpoints are used to form expressions for common belief and for iterated elimination of non-optimal strategies.Comment: 16 pages, Proc. 11th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XI). To appea

    Privacy-Preserving Trust Management Mechanisms from Private Matching Schemes

    Full text link
    Cryptographic primitives are essential for constructing privacy-preserving communication mechanisms. There are situations in which two parties that do not know each other need to exchange sensitive information on the Internet. Trust management mechanisms make use of digital credentials and certificates in order to establish trust among these strangers. We address the problem of choosing which credentials are exchanged. During this process, each party should learn no information about the preferences of the other party other than strictly required for trust establishment. We present a method to reach an agreement on the credentials to be exchanged that preserves the privacy of the parties. Our method is based on secure two-party computation protocols for set intersection. Namely, it is constructed from private matching schemes.Comment: The material in this paper will be presented in part at the 8th DPM International Workshop on Data Privacy Management (DPM 2013
    • …
    corecore