scholarly journals Stochastic Games with Disjunctions of Multiple Objectives

2021 ◽  
Vol 346 ◽  
pp. 83-100
Author(s):  
Tobias Winkler ◽  
Maximilian Weininger
2018 ◽  
Vol 261 ◽  
pp. 536-587 ◽  
Author(s):  
N. Basset ◽  
M. Kwiatkowska ◽  
C. Wiltsche

Author(s):  
Taolue Chen ◽  
Vojtěch Forejt ◽  
Marta Kwiatkowska ◽  
Aistis Simaitis ◽  
Clemens Wiltsche

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 230
Author(s):  
Elena Parilina ◽  
Stepan Akimochkin

In stochastic games, the player’s payoff is a stochastic variable. In most papers, expected payoff is considered as a payoff, which means the risk neutrality of the players. However, there may exist risk-sensitive players who would take into account “risk” measuring their stochastic payoffs. In the paper, we propose a model of stochastic games with mean-variance payoff functions, which is the sum of expectation and standard deviation multiplied by a coefficient characterizing a player’s attention to risk. We construct a cooperative version of a stochastic game with mean-variance preferences by defining characteristic function using a maxmin approach. The imputation in a cooperative stochastic game with mean-variance preferences is supposed to be a random vector. We construct the core of a cooperative stochastic game with mean-variance preferences. The paper extends existing models of discrete-time stochastic games and approaches to find cooperative solutions in these games.


2021 ◽  
Vol 24 (2) ◽  
pp. 1-35
Author(s):  
Isabel Wagner ◽  
Iryna Yevseyeva

The ability to measure privacy accurately and consistently is key in the development of new privacy protections. However, recent studies have uncovered weaknesses in existing privacy metrics, as well as weaknesses caused by the use of only a single privacy metric. Metrics suites, or combinations of privacy metrics, are a promising mechanism to alleviate these weaknesses, if we can solve two open problems: which metrics should be combined and how. In this article, we tackle the first problem, i.e., the selection of metrics for strong metrics suites, by formulating it as a knapsack optimization problem with both single and multiple objectives. Because solving this problem exactly is difficult due to the large number of combinations and many qualities/objectives that need to be evaluated for each metrics suite, we apply 16 existing evolutionary and metaheuristic optimization algorithms. We solve the optimization problem for three privacy application domains: genomic privacy, graph privacy, and vehicular communications privacy. We find that the resulting metrics suites have better properties, i.e., higher monotonicity, diversity, evenness, and shared value range, than previously proposed metrics suites.


2016 ◽  
Vol 10 (4) ◽  
pp. 1-28 ◽  
Author(s):  
Javier Cámara ◽  
Gabriel A. Moreno ◽  
David Garlan ◽  
Bradley Schmerl

Sign in / Sign up

Export Citation Format

Share Document