Two-Person Zero-Sum Communicating Stochastic Games

Date

1997-10-26

Author

Avşar, Zeynep Müge

Metadata

Show full item record

Item Usage Stats

138
views

0
downloads

For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property, i.e., working with irreducible games over restricted strategy spaces. The proposed procedure gives the value of the communicating game with an arbitrarily small error when the value is independent of the initial state.

Subject Keywords

Stochastic games, Communicating chains, Irreducible games

URI

https://hdl.handle.net/11511/71161

Conference Name

INFORMS Conference, Institute for Operations Research and the Management Sciences (1997)

Collections

Department of Industrial Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A note on two-person zero-sum communicating stochastic games Avşar, Zeynep Müge (Elsevier BV, 2006-07-01) For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property, i.e., working with irreducible games over restricted strategy spaces. The proposed procedure gives the value of the communicating game with an arbitrarily small error when the value is independent of the initial state.
A visual interactive approach for scenario-based stochastic multi-objective problems and an application Balibek, E.; Köksalan, Mustafa Murat (2012-12-01) In many practical applications of stochastic programming, discretization of continuous random variables in the form of a scenario tree is required. In this paper, we deal with the randomness in scenario generation and present a visual interactive method for scenario-based stochastic multi-objective problems. The method relies on multi-variate statistical analysis of solutions obtained from a multi-objective stochastic problem to construct joint confidence regions for the objective function values. The decis...
Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria Kazikli, Ertan; Sarıtaş, Serkan; GEZİCİ, Sinan; Linder, Tamas; Yuksel, Serdar (2022-03-01) We investigate the equilibrium behavior for the decentralized cheap talk problem for real random variables and quadratic cost criteria in which an encoder and a decoder have misaligned objective functions. In prior work, it has been shown that the number of bins in any equilibrium has to be countable, generalizing a classical result due to Crawford and Sobel who considered sources with density supported on [0, 1]. In this paper, we first refine this result in the context of log-concave sources. For sources ...
Dynamic signaling games with quadratic criteria under Nash and Stackelberg equilibria Yuksel, Serdar; Sarıtaş, Serkan; Gezici, Sinan (2020-05-01) This paper considers dynamic (multi-stage) signaling games involving an encoder and a decoder who have subjective models on the cost functions. We consider both Nash (simultaneous-move) and Stackelberg (leader-follower) equilibria of dynamic signaling games under quadratic criteria. For the multi-stage scalar cheap talk, we show that the final stage equilibrium is always quantized and under further conditions the equilibria for all time stages must be quantized. In contrast, the Stackelberg equilibria are a...
Multi–target implementation of a domain specific language for extended feature models Demirtaş, Görkem; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2018) Translation of feature models to constraint logic programs is an effective method to enable their automated analysis using existing constraint solvers. More flexibility can be offered for building and application of analysis operations on extended feature models by providing a syntax and mechanism for interfacing the host solver with user defined constraint predicates. These constraints, such as global constraints, can be provided by the constraint solver runtime or by the translator itself as a part of the...

Citation Formats

Z. M. Avşar, “Two-Person Zero-Sum Communicating Stochastic Games,” presented at the INFORMS Conference, Institute for Operations Research and the Management Sciences (1997), Texas, Amerika Birleşik Devletleri, 1997, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/71161.