Results 51 to 60 of about 596,890 (279)

Set-theoretical and Combinatorial Instruments for Problem Space Analysis in Adaptive Serious Games

open access: yesInternational Journal of Serious Games, 2018
The Computerized Adaptive Practice (CAP) system describes a set of algorithms for assessing player’s expertise and difficulties of in-game problems and for adapting the latter to the former. However, an effective use of CAP requires that in-game problems
Enkhbold Nyamsuren   +2 more
doaj   +1 more source

Combinatorial games on a graph

open access: yesDiscrete Mathematics, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Combinatorial Games with Incomplete Information

open access: yesJIAF-JFPDA
Games with incomplete information model multi-agent interaction in which players do not have common knowledge of the game they play. We propose a minimal generalisation of combinatorial games to incorporate incomplete information, called combinatorial ...
Junkang Li, Bruno Zanuttini, V. Ventos
semanticscholar   +1 more source

Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting

open access: yesInternational Colloquium on Automata, Languages and Programming, 2020
In a Stackelberg Pricing Game a distinguished player, the leader , chooses prices for a set of items, and the other players, the followers , each seek to buy a minimum cost feasible subset of the items.
Toni Böhnlein   +2 more
semanticscholar   +1 more source

Combinatorial games with a pass: a dynamical systems approach. [PDF]

open access: yesChaos, 2011
By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior.
Rebecca E. Morrison   +2 more
semanticscholar   +1 more source

Computation and efficiency of potential function minimizers of combinatorial congestion games

open access: yesMathematical programming, 2020
We study the computation and efficiency of pure Nash equilibria in combinatorial congestion games, where the strategies of each player i are given by the binary vectors of a polytope Pi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage ...
P. Kleer, G. Schäfer
semanticscholar   +1 more source

Combinatorial Bandits for Sequential Learning in Colonel Blotto Games [PDF]

open access: yesIEEE Conference on Decision and Control, 2019
The Colonel Blotto game is a renowned resource allocation problem with a long-standing literature in game theory (almost 100 years). In this work, we propose and study a regret-minimization model where a learner repeatedly plays the Colonel Blotto game ...
Dong Quan Vu, P. Loiseau, Alonso Silva
semanticscholar   +1 more source

Microbiome−host proteostasis crosstalk—An emerging perspective on mechanisms and interventions toward healthy longevity

open access: yesFEBS Letters, EarlyView.
Proteostasis and the gut microbiota play a key role in shaping host physiology. Microbiota‐derived metabolites, vitamins, and RNA modulate host proteostasis. Findings from model systems, including C. elegans, indicate microbes can either stabilize or disrupt host proteostasis.
Abhishek Anil Dubey, Maria Ermolaeva
wiley   +1 more source

Tumour–host interactions in Drosophila: mechanisms in the tumour micro‐ and macroenvironment

open access: yesMolecular Oncology, EarlyView.
This review examines how tumour–host crosstalk takes place at multiple levels of biological organisation, from local cell competition and immune crosstalk to organism‐wide metabolic and physiological collapse. Here, we integrate findings from Drosophila melanogaster studies that reveal conserved mechanisms through which tumours hijack host systems to ...
José Teles‐Reis, Tor Erik Rusten
wiley   +1 more source

From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory

open access: yesEntropy, 2018
In 1950, Nash proposed a natural equilibrium solution concept for games hence called Nash equilibrium, and proved that all finite games have at least one.
Christos Papadimitriou   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy