Search results for "Probability and Uncertainty"
showing 10 items of 578 documents
Recursive and bargaining values
2021
Abstract We introduce two families of values for TU-games: the recursive and bargaining values. Bargaining values are obtained as the equilibrium payoffs of the symmetric non-cooperative bargaining game proposed by Hart and Mas-Colell (1996). We show that bargaining values have a recursive structure in their definition, and we call this property recursiveness. All efficient, linear, and symmetric values that satisfy recursiveness are called recursive values. We generalize the notions of potential, and balanced contributions property, to characterize the family of recursive values. Finally, we show that if a time discount factor is considered in the bargaining model, every bargaining value h…
Values of games with probabilistic graphs
1999
Abstract In this paper we consider games with probabilistic graphs. The model we develop is an extension of the model of games with communication restrictions by Myerson (1977) . In the Myerson model each pair of players is joined by a link in the graph if and only if these two players can communicate directly. The current paper considers a more general setting in which each pair of players has some probability of direct communication. The value is defined and characterized in this context. It is a natural extension of the Myerson value and it turns out to be the Shapley value of a modified game.
REPEATED GAMES WITH PROBABILISTIC HORIZON
2005
Repeated games with probabilistic horizon are defined as those games where players have a common probability structure over the length of the game's repetition, T. In particular, for each t, they assign a probability pt to the event that "the game ends in period t". In this framework we analyze Generalized Prisoners' Dilemma games in both finite stage and differentiable stage games. Our construction shows that it is possible to reach cooperative equilibria under some conditions on the distribution of the discrete random variable T even if the expected length of the game is finite. More precisely, we completely characterize the existence of sub-game perfect cooperative equilibria in finite s…
Efficient linear fusion of partial estimators
2018
Abstract Many signal processing applications require performing statistical inference on large datasets, where computational and/or memory restrictions become an issue. In this big data setting, computing an exact global centralized estimator is often either unfeasible or impractical. Hence, several authors have considered distributed inference approaches, where the data are divided among multiple workers (cores, machines or a combination of both). The computations are then performed in parallel and the resulting partial estimators are finally combined to approximate the intractable global estimator. In this paper, we focus on the scenario where no communication exists among the workers, de…
CATs: whither and whence
2000
TAI: Hacia dónde y de dónde. En este trabajo esbozo el estado de la
 cuestión que dio lugar a los test adaptativos, centrando la discusión en el
 avance de los TAI y en particular en las expectativas que expresara Bert
 Green sobre las ventajas de esta tecnología. Se usan datos de la primera
 década donde los TAI fueron operativos, para comparar lo que ocurrió con
 aquello que se esperaba que ocurriera. Encuentro que algunas de las metas
 de TAI expresadas por Green están próximas a cumplirse, aunque la
 mayoría de ellas quedan para el futuro.
Global data on earthworm abundance, biomass, diversity and corresponding environmental properties
2021
Earthworms are an important soil taxon as ecosystem engineers, providing a variety of crucial ecosystem functions and services. Little is known about their diversity and distribution at large spatial scales, despite the availability of considerable amounts of local-scale data. Earthworm diversity data, obtained from the primary literature or provided directly by authors, were collated with information on site locations, including coordinates, habitat cover, and soil properties. Datasets were required, at a minimum, to include abundance or biomass of earthworms at a site. Where possible, site-level species lists were included, as well as the abundance and biomass of individual species and ec…
Codimension and colength sequences of algebras and growth phenomena
2015
We consider non necessarily associative algebras over a field of characteristic zero and their polynomial identities. Here we describe some of the results obtained in recent years on the sequence of codimensions and the sequence of colengths of an algebra.
On algebras of polynomial codimension growth
2016
Let A be an associative algebra over a field F of characteristic zero and let $$c_n(A), n=1, 2, \ldots $$ , be the sequence of codimensions of A. It is well-known that $$c_n(A), n=1, 2, \ldots $$ , cannot have intermediate growth, i.e., either is polynomially bounded or grows exponentially. Here we present some results on algebras whose sequence of codimensions is polynomially bounded.
Axiomatic characterization of the weighted solidarity values
2014
Abstract We define and characterize the class of all weighted solidarity values . Our first characterization employs the classical axioms determining the solidarity value (except symmetry ), that is, efficiency , additivity and the A-null player axiom , and two new axioms called proportionality and strong individual rationality . In our second axiomatization, the additivity and the A-null player axioms are replaced by a new axiom called average marginality .
QUANTITATIVE CONVERGENCE RATES FOR SUBGEOMETRIC MARKOV CHAINS
2015
We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some algorithms where uniform bounds for these constants are needed for a family of Markov kernels. Our results accommodate also some classes of inhomogeneous chains.