Search results for "Game Theory"

showing 10 items of 498 documents

Choosing Optimal Seed Nodes in Competitive Contagion.

2019

International audience; In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. Along this line, we consider a binary competitive contagion process where two infections, A and B, interact with each other and diffuse simultaneously in a network. We investigate which is the best centrality measure to find out the seed nodes a company should adopt in the presence of rivals so that it can maximize its influence. These nodes can be used as the initial spreaders or advertisers by firms when two firms compete with each other. Each node is assigned a price tag to become an initial advertiser whi…

Big Datagame theoryComputer scienceProcess (engineering)01 natural sciencescompetitive contagionMicroeconomics010104 statistics & probabilityArtificial IntelligenceNode (computer science)Computer Science (miscellaneous)seed nodes0101 mathematicsOriginal ResearchSmall numbercentrality measures010102 general mathematicsStochastic game[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]complex networksComplex networkProduct (business)CentralityGame theorycompetitive marketingInformation SystemsFrontiers in big data
researchProduct

Robust Allocation Rules in Dynamical Cooperative TU Games

2011

Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.

Bondareva–Shapley theoremgame theoryMathematical optimizationSequential gameComputer scienceComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryTheoryofComputation_GENERALConstructiveBounded functionRepeated gameVideo game designGame theoryMathematical economics
researchProduct

Monitoring brain activity in preterms: mathematics helps to predict clinical outcome: Figure 1

2015

Brain activity and meditationTreatment outcomeNeurology (clinical)PsychologyOutcome (game theory)Developmental psychologyBrain
researchProduct

Abstract 13812: Pulmonary Function Predicts Cardiac Function, Structure & Clinical Outcome in Chronic Heart Failure: Results From the Myovasc Stu…

2020

Introduction: A growing body of evidence suggests a relevance of pulmonary function in the pathophysiology of heart failure (HF). Comprehensive data on the role of forced expiratory volume in 1 second (FEV1) in the development & progression of HF is limited. Hypothesis: Given this background, we hypothesized, that (FEV1) is associated with deteriorated left ventricular (LV) functional as well as structural status, & predicts specific clinical outcome in HF. Methods: Data from the MyoVasc Study (n=3,289) were analysed. Comprehensive clinical phenotyping including body plethysmography for the evaluation of FEV1 & standardized echocardiography were performed during a five-hour inv…

Cardiac function curvemedicine.medical_specialtybusiness.industrymedicine.diseaseOutcome (game theory)PathophysiologyPulmonary function testingPhysiology (medical)Internal medicineHeart failureEpidemiologyCardiologymedicineCardiology and Cardiovascular MedicinebusinessCirculation
researchProduct

Co-morbidity does not reflect complexity in internal medicine patients

2006

Internal medicine patients are mostly elderly; they have multiple co-morbidities, which are usually chronic, rather than self-limiting or acute diseases. Neither administrative indicators nor co-morbidity indexes, though validated in elderly patients, are able to completely define these "complex" patients or to allow physicians to correctly "cope" with them. For the complex patients found in internal medicine wards, internists need not only to find the best diagnosis and treatment, but also to apply a complex intervention (i.e., a comprehensive assessment and both continuous and multi-disciplinary care) in order to maintain their health and ability to function and to prevent or delay disabi…

Clinical governancemedicine.medical_specialtyProcess (engineering)business.industrymedia_common.quotation_subjectMEDLINECo-morbidityComplexitymedicine.diseaseOutcome (game theory)ElderlyInternal medicineIntervention (counseling)Management systemInternal MedicinemedicineQuality (business)Medical emergencyFunction (engineering)businessmedia_commonEuropean Journal of Internal Medicine
researchProduct

The meaning of biological signals.

2020

We introduce the virtual special issue on content in signalling systems. The issue explores the uses and limits of ideas from evolutionary game theory and information theory for explaining the content of biological signals. We explain the basic idea of the Lewis-Skyrms sender-receiver framework, and we highlight three key themes of the issue: (i) the challenge of accounting for deception, misinformation and false content, (ii) the relevance of partial or total common interest to the evolution of meaningful signals, and (iii) how the sender-receiver framework relates to teleosemantics.

Cognitive scienceHistoryDeceptionComputer sciencemedia_common.quotation_subjectCommunicationEvolutionary game theoryQ Science (General)B Philosophy (General)General MedicineDeceptionInformation theoryBiological EvolutionModels BiologicalAnimal CommunicationMeaning (philosophy of language)History and Philosophy of ScienceGame TheoryKey (cryptography)AnimalsHumansRelevance (information retrieval)MisinformationGame theorymedia_commonStudies in history and philosophy of biological and biomedical sciences
researchProduct

Teaching types with a cognitively effective worked example format

2015

AbstractTeaching functional programming as a second programming paradigm is often difficult as students can have strong preconceptions about programming. When most of these preconceived ideas fail to be confirmed, functional programming may be seen as an unnecessarily difficult topic. A typical topic that causes such difficulties is the language of types employed by many modern functional languages. In this paper, we focus on addressing this difficulty through the use of step-by-step calculations of type expressions. The outcome of the study is an elaboration of a worked example format and a methodical approach for teaching types to beginner functional programmers.

Cognitive scienceta113Functional programmingFocus (computing)Computer scienceteaching methodsProgramming paradigmfunctional programmingOutcome (game theory)SoftwareElaborationJournal of Functional Programming
researchProduct

Nonlocal Quantum XOR Games for Large Number of Players

2010

Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.

CombinatoricsAlgebraComputer Science::Computer Science and Game TheoryQuantum pseudo-telepathySimple (abstract algebra)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALQuantum worldQuantumMathematics
researchProduct

Circuit Lower Bounds via Ehrenfeucht-Fraisse Games

2006

In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC/sup 0/ circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC/sup 0/ circuits.

CombinatoricsDiscrete mathematicsComputer Science::Hardware ArchitectureClass (set theory)Computer Science::Emerging TechnologiesComputabilityGame complexityEhrenfeucht–Fraïssé gameCircuit complexityGame theoryLinear numberElectronic circuitMathematics21st Annual IEEE Conference on Computational Complexity (CCC'06)
researchProduct

Games without repetitions on graphs with vertex disjoint cycles

1997

Games without repetitions on graphs with vertex disjoint cycles are considered. We show that the problem finding of the game partition in this class reduces to this problem for trees. A method of finding of the game partition for trees have been given in [2].

CombinatoricsVertex (graph theory)Discrete mathematicsComputer Science::Computer Science and Game TheoryGeneral MathematicsProblem findingComputingMilieux_PERSONALCOMPUTINGPartition (number theory)Disjoint setsMathematicsofComputing_DISCRETEMATHEMATICSMathematicsArchiv der Mathematik
researchProduct