?
Games with incomplete information on both sides and with a public signal on the state of the game
P. 68–78.
Gavrilovich M., Kreps V. L.
In press
Supposing that Player 1’s computational power is higher than that of Player 2, we give three examples of different kinds of public signal about the state of a two-person zero-sum game with symmetric incom- plete information on both sides (both players do not know the state of the game) where Player 1 due to his computational power learns the state of the game meanwhile it is impossible for Player 2. That is, the game with incomplete information on both sides becomes a game with incomplete information on the side of Player 2. Thus we demonstrate that information about the state of a game may appear not only due to a private signal but as a result of a public signal and asymmetric computational resources of players.
Publication based on the results of:
In book
Vol. 10. , St. Petersburg: Graduate School of Management SPbU, 2017.
Shvedov A. S., Математические заметки 2026 Т. 119 № 4 С. 616–623
В настоящей работе изучается некооперативная игра, в которой фирмы-лидеры конкурируют между собой, выбирая объемы выпуска, и фирмы-последователи конкурируют между собой, также выбирая объемы выпуска. Информация о средних предельных затратах является общедоступной, но текущие предельные затраты фирмы известны только самой фирме. Для этой игры найдены равновесные объемы выпуска. ...
Added: April 3, 2026
Molostvov V., Advances in Systems Science and Applications 2024 Vol. 24 No. 2 P. 103–115
This paper presents the development of computing tools for finding optimal structures of multi-currency deposits in terms of guaranteed risk under uncertain exchange rates. The approach utilizes Savage's minimax regret concept to calculate risk and guaranteed risk functions explicitly, assuming only the limits of possible changes in uncertain parameters are known. The Excel environment implements ...
Added: August 9, 2024
Alexey Shvedov, Economics Bulletin 2022 Vol. 42 No. 2 P. 788–792
The usual assumptions that underlie the theory of Cournot Bayesian -- Nash equilibrium under incomplete information are that the rivals' marginal costs are independently and identically distributed. Using a new mathematical method, this paper shows that the Cournot Bayesian -- Nash equilibrium exists under much more general conditions. An expression of equilibrium solutions is presented. ...
Added: April 8, 2024
Margarita V. Remizowa, Shipunov A., Sokoloff D., Botanica Pacifica 2023 Vol. 12 No. 2 P. 3–14
Pendent sessile flowers of Chamaelirium japonicum (Willd.) N. Tanaka appear zygomorpic, but they do not possess a bilateral symmetry. The flowers are subtended by a vestigial bract and lack a bracteole. The perianth consists of two small tepals on the abaxial side of the flower and four large tepals, none of which is median. Because ...
Added: February 20, 2024
Милостивая А. И., В кн.: Теория и практика коммуникации: Материалы I Международной научно-практической конференции, Тирасполь, Приднестровский государственный университет им. Т. Г. Шевченко, 27-28 февраля 2023 г.: том 1Т. 1.: Тирасполь: [б.и.], 2023. С. 26–36.
This article analyzes modern linguistic synergetics’ concepts to identify this discipline's main ways and prospects in scientific episteme. The author focuses on the paradigm status and explanatory potential of lingua-synergetic studies. Data for this investigation consists of scientific articles, dissertations and monographs, which set out various versions of the synergistic interpretation of speech activity. As ...
Added: February 11, 2024
Мещеряков М. В., Сухарев Л. А., Саранск: Изд-во Мордовского университета, 2018.
The book is an introductory course on the theory of formal languages and finite automata. It presents the main material of diciplina related to the mathematical foundations of a number of syntactic methods of inormatics and programming. The book is intended for undergraduate students in the following fields of study: fundamental computer science and information ...
Added: October 12, 2023
Veselova Y. A., , in: Data Analysis and Optimization. In Honor of Boris Mirkin's 80th Birthday.: Springer, 2023. P. 377–395.
We consider the problem of coalitional manipulation in collective decision
making and a probabilistic approach for solving it. We assume that voters have some
information about other voters’ preferences from opinion polls held before voting.
There are 5 different types of poll information functions. Coalition members are assumed
to have identical preferences. We consider the probability that in a ...
Added: August 31, 2023
Zapryagaev A., / Series arXiv "math". 2022.
Büchi arithmetics BA_n, n >= 2, are extensions of Presburger arithmetic with an unary functional symbol V_n(x) denoting the largest power of n that divides x. Definability of a set in BA_n is equivalent to its recognizability by a finite automaton receiving numbers in their n-ary expansion. We show that Büchi arithmetics BA_n and BA_m ...
Added: December 5, 2022
Kolpakov A., Talambutsa A., International Mathematics Research Notices 2022 Vol. 2022 No. 19 P. 14675–14696
We define a large class of abstract Coxeter groups that we call ∞–spanned, and for which the word growth rate and the geodesic growth rate appear to be Perron numbers. This class contains a fair amount of Coxeter groups acting on hyperbolic spaces, thus corroborating a conjecture by Kellerhals and Perren. We also show that for ...
Added: October 10, 2021
Galatenko A. V., Кузовихина В. А., Программная инженерия 2021 № 3 С. 150–156
We propose an automata model of computer system security. A system is represented by a finite automaton with states partitioned into two subsets: "secure" and "insecure". System functioning is secure if the number of consecutive insecure states is not greater than some nonnegative integer k. This definition allows one to formally reflect responsiveness to security ...
Added: June 16, 2021
Meshcheryakova N., , in: 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).: IEEE, 2020. P. 379–383.
Trade statistics is a vivid example of bilateral data with asymmetry. Exporter and importer report their own versions of a flow between them, that frequently differ in dozens of times. In order to construct a network of trade relations we need to choose only one value for each weighted edge. We propose new methodology that ...
Added: April 13, 2021
Kharkhurin A. V., Charkhabi M., Symmetry 2021 Vol. 13 Article 343
The study is a part of a research project, which explores the role of creative perception in creative behavior. We operationalized creative behavior as an ability to overcome structured imagination, as measured by the Invented Alien Creature test, and operationalized creative perception as a preference for complexity and asymmetry, which we assessed using a standard ...
Added: February 22, 2021
Veselova Y. A., Group Decision and Negotiation 2020 Vol. 29 No. 3 P. 523–548
We consider the problem of individual manipulation under incomplete information, when voters do not know a full preference profile. Instead, voters know the result of an opinion poll (the outcome of a poll information function π, e.g. a list of scores or a set of winners). In this case, a voter has an incentive to ...
Added: May 14, 2020
Apresyan V., Шмелев А. Д., Russian Linguistics 2020 Т. 44 № 3 С. 203–230
This paper considers temporal meanings of Russian spatial adverbs and adjectives. We demonstrate the asymmetry between the temporal meanings of proximal and distal spatial words and analyze its semantic sources. One of the main manifestations of this asymmetry is the preferred future reference in the words denoting closeness (cf. blizkie kanikult ‘close vacations’ = ‘holidays ...
Added: May 9, 2020
Boros E., Elbassioni K., Gurvich V. et al., Information and Computation 2019 Vol. 267 P. 74–95
We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G=(V,E), with local rewards r:E→Z, and three types of positions: black VB, white VW, and random VR forming a partition of V. It is a long-standing open question whether a polynomial time algorithm for BWR-games exists, or not, even when |VR|=0. In fact, a pseudo-polynomial algorithm for BWR-games ...
Added: December 9, 2019
Sergey S. Ketkov, Oleg A. Prokopyev, Omega 2020 Vol. 92 P. 102161
We consider a class of sequential network interdiction problem settings where the interdictor has incomplete initial information about the network while the evader has complete knowledge of the network including its structure and arc costs. In each decision epoch, the interdictor can block (for the duration of the epoch) at most k arcs known to him. By ...
Added: October 20, 2019
Kreps V. L., Gavrilovich M., Математическая теория игр и ее приложения 2019 Т. 11 № 1 С. 21–38
Matrix games with incomplete information on both sides and public signal on the state of game represented by random binary code of fixed length are considered. Players are computationally bounded and are only able to play strategies to finite automata of different sizes: m for Player 1 and n for Player 2 where m ≫ ...
Added: May 31, 2019