Search results for "bayesian"
showing 10 items of 604 documents
A model of adaptive decision-making from representation of information environment by quantum fields
2017
We present the mathematical model of decision making (DM) of agents acting in a complex and uncertain environment (combining huge variety of economical, financial, behavioral, and geo-political factors). To describe interaction of agents with it, we apply the formalism of quantum field theory (QTF). Quantum fields are of the purely informational nature. The QFT-model can be treated as a far relative of the expected utility theory, where the role of utility is played by adaptivity to an environment (bath). However, this sort of utility-adaptivity cannot be represented simply as a numerical function. The operator representation in Hilbert space is used and adaptivity is described as in quantu…
Optimizing channel selection for cognitive radio networks using a distributed Bayesian learning automata-based approach
2015
Consider a multi-channel Cognitive Radio Network (CRN) with multiple Primary Users (PUs), and multiple Secondary Users (SUs) competing for access to the channels. In this scenario, it is essential for SUs to avoid collision among one another while maintaining efficient usage of the available transmission opportunities. We investigate two channel access schemes. In the first model, an SU selects a channel and sends a packet directly without Carrier Sensing (CS) whenever the PU is absent on this channel. In the second model, an SU invokes CS in order to avoid collision among co-channel SUs. For each model, we analyze the channel selection problem and prove that it is a so-called "Exact Potent…
Convex semi-infinite games
1986
This paper introduces a generalization of semi-infinite games. The pure strategies for player I involve choosing one function from an infinite family of convex functions, while the set of mixed strategies for player II is a closed convex setC inRn. The minimax theorem applies under a condition which limits the directions of recession ofC. Player II always has optimal strategies. These are shown to exist for player I also if a certain infinite system verifies the property of Farkas-Minkowski. The paper also studies certain conditions that guarantee the finiteness of the value of the game and the existence of optimal pure strategies for player I.
Consensus in inventory games
2008
This paper studies design, convergence, stability and optimality of a distributed consensus protocol for n-player repeated non cooperative games under incomplete information. Information available to each player concerning the other players' strategies evolves in time. At each stage (time period), the players select myopically their best binary strategy on the basis of a payoff, defined on a single stage, monotonically decreasing with the number of active players. The game is specialized to an inventory application, where fixed costs are shared among all retailers, interested in reordering or not from a common warehouse. As information evolves in time, the number of active players changes t…
Heterogeneous network games: Conflicting preferences
2013
Proceeding at: 2nd Annual UECE Lisbon Meeting: Game Theory and Applications, took place 2010, November, 4-6, in Lisbon (Portugal). The event Web site http://pascal.iseg.utl.pt/~uece/lisbonmeetings2010/ In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thr…
Noncooperative dynamic games for inventory applications: A consensus approach
2008
We focus on a finite horizon noncooperative dynamic game where the stage cost of a single player associated to a decision is a monotonically nonincreasing function of the total number of players making the same decision. For the single-stage version of the game, we characterize Nash equilibria and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multi-stage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately not necessarily Pareto optimal. The algorithm returns a seque…
Feature Selection for Ensembles of Simple Bayesian Classifiers
2002
A popular method for creating an accurate classifier from a set of training data is to train several classifiers, and then to combine their predictions. The ensembles of simple Bayesian classifiers have traditionally not been a focus of research. However, the simple Bayesian classifier has much broader applicability than previously thought. Besides its high classification accuracy, it also has advantages in terms of simplicity, learning speed, classification speed, storage space, and incrementality. One way to generate an ensemble of simple Bayesian classifiers is to use different feature subsets as in the random subspace method. In this paper we present a technique for building ensembles o…
Propuesta bayesiana para la elaboración de mapas genéticos
2016
En los últimos años, los avances en la investigación biotecnológica, permiten manipular genes o grupos de genes de forma específica en el genoma de los organismos vegetales para producir cultivos con mejores características. Su objetivo es la obtención de especies mejoradas con peculiaridades deseables como un crecimiento más rápido, capaces de una adaptación al medio en el que se desarrollan, más resistentes a plagas o a enfermedades o simplemente proporcionando frutos más grandes, uniformes y de mejor calidad. La investigación y el desarrollo sobre los marcadores moleculares está contribuyendo a la comprensión de los resultados derivados de la herencia de caracteres cuantitativos y a una …
Soluciones bioinformáticas para el análisis de datos ómicos, descubrimiento de conocimiento y diagnóstico genético en Sparus aurata y otros organismo…
2023
Esta tesis ha sido financiada por el Ministerio de Ciencia e Innovación a través de la ayuda “DI-17-09134” para contratos para la formación de doctores en empresas (Doctorados Industriales). Con el incremento de datos generados mediante el uso de las tecnologías de secuenciación, es necesario el diseño de protocolos y herramientas que permitan el análisis y la integración de los mismos con el objetivo de entender y comprender los sistemas biológicos que forman parte de cada estudio en particular. Estas herramientas, además, es preferible que sean intuitivas y de fácil manejo para los usuarios, de manera que puedan ser utilizadas por cualquier investigador y no solamente por aquellos que sea…
Flexible Bayesian survival models with application in biometric studies
2018
El análisis de supervivencia es una metodología estadística diseñada para analizar datos procedentes de estudios científicos relativos a tiempos de ocurrencia de uno o varios eventos de interés. La duración de estos tiempos suele conocerse como tiempos de supervivencia debido a los particulares orígenes de esta metodología en contextos exclusivamente médicos y demográficos. Durante las últimas décadas, la literatura científica en este campo ha sido muy prolífica y su aplicación se ha extendido a múltiples áreas de conocimiento. Los procedimientos estadísticos propios de esta metodología empezaron a abordarse desde el marco inferencial frecuentista. Sin embargo, en los últimos años la utiliz…