Search results for "Game Theory"

showing 10 items of 498 documents

On Ibn Ezra's Procedure and Shapley Value

2014

We examine ibn Ezra's procedure (Rabinovitch 1973; O'Neill 1982) historically used to solve the Rights Arbitration problem in the general framework of bankruptcy problems. When the greatest claim is larger than or equal to the estate, the procedure is a maximal game (Aumann 2010). However, when the greatest claim is smaller than the estate, the axioms of efficiency (the whole estate is distributed) and satiation are difficult to satisfy simultaneously. We discuss both axioms to show that their importance and necessity are radically different. From then, for the part of the estate not covered by the greatest claim, we examine four possible procedures: the minimal overlap rule, Alcalde et al.…

Dictator gameUnanimityEconomicsArbitrationRepeated gameEstateShapley valueGame theoryMathematical economicsAxiomSSRN Electronic Journal
researchProduct

Group-level analysis on multiplayer game collaboration: how do the individuals shape the group interaction?

2010

In this study, the aim was to examine how small-group collaboration is shaped by individuals interacting in a virtual multiplayer game. The data were collected from a design experiment in which six randomly divided groups of four university students played a voice-enhanced game lasting about 1 h. The ‘eScape’ game was a social action adventure developed as a part of the study. In the analysis of the video data, students' discourse functions during the game were analysed with content analytic methods for studying the nature of their interaction. An effort was made to analyse the data on both group and individual levels, and therefore the participants' prior social ties and experience in gami…

Discourse analysismedia_common.quotation_subjectComputingMilieux_PERSONALCOMPUTINGAdventureComputer Science ApplicationsEducationInterpersonal tiesInterpersonal relationshipContent analysisConversationMultiplayer gamePsychologySocial psychologyGame theorymedia_commonInteractive Learning Environments
researchProduct

Claws contained in all n-tournaments

1993

Abstract We prove that any claw of order n with degree d≤ 3 8 n is n-unavoidable, which means that any tournament of order n contains it as a subdigraph. A simple corollary is that any tournament has a directed Hamiltonian path.

Discrete mathematicsComputer Science::Computer Science and Game TheoryClawMathematics::CombinatoricsComputer Science::Neural and Evolutionary ComputationHamiltonian pathTheoretical Computer ScienceCombinatoricssymbols.namesakeCorollaryComputer Science::Discrete MathematicssymbolsDiscrete Mathematics and CombinatoricsTournamentMathematicsDiscrete Mathematics
researchProduct

On symmetric nonlocal games

2013

Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.

Discrete mathematicsComputer Science::Computer Science and Game TheoryGeneral Computer ScienceQuantum pseudo-telepathyGeneralizationSymmetric gameComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryTheoryofComputation_GENERALSymmetric probability distributionTheoretical Computer ScienceSimple (abstract algebra)Quantum worldMathematical economicsQuantumMathematicsTheoretical Computer Science
researchProduct

Graph connectivity and monadic NP

2002

Ehrenfeucht games are a useful tool in proving that certain properties of finite structures are not expressible by formulas of a certain type. In this paper a new method is introduced that allows the extension of a local winning strategy for Duplicator, one of the two players in Ehrenfeucht games, to a global winning strategy. As an application it is shown that graph connectivity cannot be expressed by existential second-order formulas, where the second-order quantification is restricted to unary relations (monadic NP), even, in the presence of a built-in linear order. As a second application it is stated, that, on the other hand, the presence of a linear order increases the power of monadi…

Discrete mathematicsComputer Science::Computer Science and Game TheoryUnary operationComputational complexity theoryRelation (database)Extension (predicate logic)Type (model theory)CombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Logic in Computer ScienceOrder (group theory)Game theoryComputer Science::Formal Languages and Automata TheoryConnectivityMathematicsProceedings 35th Annual Symposium on Foundations of Computer Science
researchProduct

Balls into non-uniform bins

2014

Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…

Discrete mathematicsMathematical optimizationComputational complexity theoryComputer Networks and CommunicationsComputer scienceDistributed computingAstrophysics::Cosmology and Extragalactic AstrophysicsPhysics::Data Analysis; Statistics and ProbabilityLoad balancing (computing)BinTheoretical Computer ScienceLoad managementCapacity planningArtificial IntelligenceHardware and ArchitectureTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYBounded functionBall (bearing)Resource allocationHardware_ARITHMETICANDLOGICSTRUCTURESGame theorySoftwareMathematicsMathematicsofComputing_DISCRETEMATHEMATICS2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
researchProduct

Experimental duopolies under price guarantees

2011

In a symmetric differentiated experimental duopoly we test the ability of Price Guarantees (PGs) to raise prices above the competitive levels. Different types of PGs ("aggressive" and "soft" price-beating and price-matching) are implemented either as an exogenously imposed market rule or as a business strategy. Our results show that PGs may lead close to the collusive outcome, depending on whether the interaction between duopolists is repeated and provided that the guarantee is not of the "aggressive" price-beating type.

DuopolisEconomics and EconometricsL11TheoryofComputation_GENERALProduct differentiationProduct differentiationOutcome (game theory)Price guaranteesExperimental duopoliesMicroeconomicsDiferenciació de productesPreusC91EconomicsSocial Sciences & HumanitiesDuopoly
researchProduct

Behavioral and Neural Arguments of Motivational Influence on Decision Making During Uncertainty

2020

The scientific world is increasingly interested in motivation, primarily due to the suspected impact on decision-making abilities, particularly in uncertain conditions. To explore this plausible relationship, 28 healthy participants were included in the study and performed decision-making and motivational tasks while their neural activity was recorded. All participants performed the Iowa Gambling Task (IGT) and were split into two groups based on their score, one favorable group with 14 participants who performed advantageously and one undecided group with 14 participants who failed to develop the correct strategy on the IGT. In addition, all participants performed the Effort Expenditure fo…

EEfRTeffortElectroencephalographyOutcome (game theory)050105 experimental psychologyTask (project management)lcsh:RC321-57103 medical and health sciencesNeural activity0302 clinical medicinemotivationReward sensitivitymedicine0501 psychology and cognitive sciencesP300uncertaintylcsh:Neurosciences. Biological psychiatry. NeuropsychiatryOriginal Researchmedicine.diagnostic_testGeneral Neuroscience05 social sciencesIGTdecision-makingP300 amplitudeIowa gambling taskGroup analysisPsychology030217 neurology & neurosurgeryNeuroscienceCognitive psychologyFrontiers in Neuroscience
researchProduct

Basel III: Countercyclical Capital Buffer Proposal-the Case of Baltics

2014

Abstract The objective of countercyclical capital buffer is to encourage banks to build up buffers in good times that can be drawn down in bad times. The aim of the report is to assess such decisions by banks derived from two approaches. The approaches are the aggregate credit-to-GDP ratio as well as credit growth. The approaches are implemented for Estonia, Latvia and Lithuania for the time period 2000–2012. The report compares two approaches and analyses their relevance to the Baltic states by testing the correlation between a growth in studied variables and a growth of corresponding gaps. Methods used in the empirical part of the report are econometric analysis as well as economic analys…

Econometric analysisBasel IIIcredit growthMonetary economicsInternational economicsBaltic statesOutcome (game theory)Basel IIIbanksCapital (economics)EconomicsEconomic analysisGeneral Materials Sciencecountercyclical capital bufferProcedia - Social and Behavioral Sciences
researchProduct

Cooperation among competitors: A comparison of cost-sharing mechanisms

2016

Abstract In this paper, we investigate the consequences of using outcome-based versus ex ante-based cost-sharing mechanisms in terms of competing firms' profitability and total welfare. We consider two firms making a joint expenditure, which can positively affect firms' demand and/or unit operating costs, while competing in the final market by setting either price or quantity. We compare two outcome-based cost-sharing mechanisms, i.e., Quantity Proportional (QP) and Total Margin proportional (TM), with the more competitive Fixed Share (FS) mechanism where cost-sharing is set up on an ex ante basis. We show that outcome-based mechanisms, and even a fully collusive behavior induced by the opt…

Economics and Econometrics0211 other engineering and technologiesCost-sharing mechanism02 engineering and technologyManagement Science and Operations ResearchOutcome (game theory)Industrial and Manufacturing EngineeringCompetition (economics)Microeconomics0502 economics and businessEconomicsGame theory.Industrial organization021103 operations researchCompetitionEx-ante05 social sciencesCompetitor analysisEconomic surplusSettore ING-IND/35 - Ingegneria Economico-GestionaleCooperation; Competition; Cost-sharing mechanisms; Decision making; Game theory.General Business Management and AccountingCooperationCost sharingProfitability indexDecision makingGame theory050203 business & managementInternational Journal of Production Economics
researchProduct