43,229 research outputs found
Nash equilibria for non zero-sum ergodic stochastic differential games
In this paper we consider non zero-sum games where multiple players control
the drift of a process, and their payoffs depend on its ergodic behaviour. We
establish their connection with systems of Ergodic BSDEs, and prove the
existence of a Nash equilibrium under the generalised Isaac's conditions. We
also study the case of interacting players of different type
Some new directions in infinite-combinatorial topology
We give a light introduction to selection principles in topology, a young
subfield of infinite-combinatorial topology. Emphasis is put on the modern
approach to the problems it deals with. Recent results are described, and open
problems are stated. Some results which do not appear elsewhere are also
included, with proofs.Comment: Small update
Quantum Probabilities as Behavioral Probabilities
We demonstrate that behavioral probabilities of human decision makers share
many common features with quantum probabilities. This does not imply that
humans are some quantum objects, but just shows that the mathematics of quantum
theory is applicable to the description of human decision making. The
applicability of quantum rules for describing decision making is connected with
the nontrivial process of making decisions in the case of composite prospects
under uncertainty. Such a process involves deliberations of a decision maker
when making a choice. In addition to the evaluation of the utilities of
considered prospects, real decision makers also appreciate their respective
attractiveness. Therefore, human choice is not based solely on the utility of
prospects, but includes the necessity of resolving the utility-attraction
duality. In order to justify that human consciousness really functions
similarly to the rules of quantum theory, we develop an approach defining human
behavioral probabilities as the probabilities determined by quantum rules. We
show that quantum behavioral probabilities of humans not merely explain
qualitatively how human decisions are made, but they predict quantitative
values of the behavioral probabilities. Analyzing a large set of empirical
data, we find good quantitative agreement between theoretical predictions and
observed experimental data.Comment: Latex file, 32 page
Optimal Strategies in Infinite-state Stochastic Reachability Games
We consider perfect-information reachability stochastic games for 2 players
on infinite graphs. We identify a subclass of such games, and prove two
interesting properties of it: first, Player Max always has optimal strategies
in games from this subclass, and second, these games are strongly determined.
The subclass is defined by the property that the set of all values can only
have one accumulation point -- 0. Our results nicely mirror recent results for
finitely-branching games, where, on the contrary, Player Min always has optimal
strategies. However, our proof methods are substantially different, because the
roles of the players are not symmetric. We also do not restrict the branching
of the games. Finally, we apply our results in the context of recently studied
One-Counter stochastic games
A Practical Algorithm for Topic Modeling with Provable Guarantees
Topic models provide a useful method for dimensionality reduction and
exploratory data analysis in large text corpora. Most approaches to topic model
inference have been based on a maximum likelihood objective. Efficient
algorithms exist that approximate this objective, but they have no provable
guarantees. Recently, algorithms have been introduced that provide provable
bounds, but these algorithms are not practical because they are inefficient and
not robust to violations of model assumptions. In this paper we present an
algorithm for topic model inference that is both provable and practical. The
algorithm produces results comparable to the best MCMC implementations while
running orders of magnitude faster.Comment: 26 page
A survey of random processes with reinforcement
The models surveyed include generalized P\'{o}lya urns, reinforced random
walks, interacting urn models, and continuous reinforced processes. Emphasis is
on methods and results, with sketches provided of some proofs. Applications are
discussed in statistics, biology, economics and a number of other areas.Comment: Published at http://dx.doi.org/10.1214/07-PS094 in the Probability
Surveys (http://www.i-journals.org/ps/) by the Institute of Mathematical
Statistics (http://www.imstat.org
- …