2 citations · 2 across the 9 of their papers we have counts for
10 papers
The Expected Number of Pairwise Stable Networks
P. Jean-Jacques Herings, Christian Seel, Arkadi Predtetchinski
This paper studies probabilistic properties of pairwise stability for a network model where individual utilities are random variables. We study the probability that a given network…
Optimal strategies in Markov decision processes with finitely additive evaluations
János Flesch, Arkadi Predtetchinski, William D Sudderth +1
We study infinite-horizon Markov decision processes (MDPs) where the decision maker evaluates each of her strategies by aggregating the infinite stream of expected stage-rewards. T…
Approximations of expectations under infinite product measures
Galit Ashkenazi-Golan, János Flesch, Arkadi Predtetchinski +1
We are given a bounded Borel-measurable real-valued function on a product of countably many Polish spaces, and a product probability measure. We are interested in points in the pro…
Zero-one Laws for a Control Problem with Random Action Sets
János Flesch, Arkadi Predtetchinski, William D Sudderth +1
In many control problems there is only limited information about the actions that will be available at future stages. We introduce a framework where the Controller chooses actions…
Regularity of the minmax value and equilibria in multiplayer Blackwell games
Galit Ashkenazi-Golan, János Flesch, Arkadi Predtetchinski +1
A real-valued function that is defined over all Borel sets of a topological space is \emph{regular} if for every Borel set , is the supremum of , over all close…
Equilibria in Repeated Games with Countably Many Players and Tail-Measurable Payoffs
Galit Ashkenazi-Golan, Janos Flesch, Arkadi Predtetchinski +1
We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an -equilibrium, for every .