DSpace at Saint Petersburg State UniversityСистема цифрового хранилища Dspace получает, хранит, индексирует и распространяет цифровые исследовательские материалы.https://dspace.spbu.ru:4432021-11-30T10:02:19Z2021-11-30T10:02:19ZRussian merchants in Livonia in the 17th centuryAngermann, Norberthttp://hdl.handle.net/11701/337102021-11-29T21:24:46Z2021-09-01T00:00:00ZНазвание: Russian merchants in Livonia in the 17th century
Авторы: Angermann, Norbert
Краткий осмотр (реферат): The paper describes the trade activity of Russian merchants in Livonia (in the widest sense of
the term, including Estonia), which was under the rule of Sweden and Poland in the 17th century and later
only under the Swedish rule. The main purpose of Russian merchants in the beginning of the 17th century
was Reval (Tallinn) and later Narva. They also visited Riga and much less Dorpat (today’s Tartu). The author
was able to identify new evidence of this by working in the archives of Baltic cities. Shopping yards for
Russian merchants were established in Riga, Narva and Dorpat, which served as living quarters and a place
for storing and selling goods. Interesting information about this is provided by the accounts of German farm
administrators in Narva and Derpt, which are analyzed in this article for the first time. Russian guests in
Livonia were mainly middle and minor merchants, as well as representatives of the largest trading companies
in Novgorod and Pskov, commissioners of the tsars and, on the other hand, artisans, peasants and fishermen.
Their activities served the extensive European trade in linen, hemp, leather, fat and fur as the main Russian
supplies. The Livonian inhabitants were also supplied with industrial and agricultural products. The number
of visitors to Livonia from northwest Russia and beyond was significantly higher than the number of Livonian
merchants trading in Novgorod, Pskov and Moscow.2021-09-01T00:00:00ZIn Memory of Victoria Krepshttp://hdl.handle.net/11701/337082021-11-29T21:13:53Z2021-10-01T00:00:00ZНазвание: In Memory of Victoria Kreps
Краткий осмотр (реферат): In Memory of Victoria Kreps2021-10-01T00:00:00ZThe International Conference on Game Theory and ManagementSedakov, Artemhttp://hdl.handle.net/11701/337072021-11-29T21:09:28Z2021-10-01T00:00:00ZНазвание: The International Conference on Game Theory and Management
Авторы: Sedakov, Artem
Краткий осмотр (реферат): This note overviews the Game Theory and Management conferences
that have been held annually at Saint Petersburg State University
since 2007.2021-10-01T00:00:00ZA Categorical Characterization of a ①-Iteratively De ned State of Common KnowledgeTohmé, FernandoCaterina, GianlucaGangle, Roccohttp://hdl.handle.net/11701/337062021-11-29T20:55:49Z2021-10-01T00:00:00ZНазвание: A Categorical Characterization of a ①-Iteratively De ned State of Common Knowledge
Авторы: Tohmé, Fernando; Caterina, Gianluca; Gangle, Rocco
Краткий осмотр (реферат): We present here a novel approach to the analysis of common
knowledge based on category theory. In particular, we model the global epistemic
state for a given set of agents through a hierarchy of beliefs represented
by a presheaf construction. Then, by employing the properties of a
categorical monad, we prove the existence of a state, obtained in an iterative
fashion, in which all agents acquire common knowledge of some underlying
statement. In order to guarantee the existence of a fixed point under certain
suitable conditions, we make use of the properties entailed by Sergeyev's
numeral system called grossone, which allows a finer control on the relevant
structure of the infinitely nested epistemic states.2021-10-01T00:00:00ZImplementation of a Multi-Objective Working Capital Management Strategy for Financial Supply ChainsSmirnova, MariiaIvakina, AnastasiiaZenkevich, Nikolayhttp://hdl.handle.net/11701/337052021-11-29T20:48:52Z2021-10-01T00:00:00ZНазвание: Implementation of a Multi-Objective Working Capital Management Strategy for Financial Supply Chains
Авторы: Smirnova, Mariia; Ivakina, Anastasiia; Zenkevich, Nikolay
Краткий осмотр (реферат): The issue of adequate application of quantitative supply chain
(SCF) solutions for cooperative working capital management becomes more
and more important in terms of globalization and growing competition between
supply chains (SCs). Authors address the problem by developing models
for cooperative working capital management (WCM) through SCF adoption
for the case of the three-stage supply chain. The grounding for the
optimization is multicriteria approach. The multi-objective working capital
optimization model (Ivakina et al., 2021) allows to nd optimal solution regardless
initial financial and liquidity position of SC. In the article, we use
this model to quantitatively implement a multi-objective working capital
management strategy on the cases of real supply chains. The results obtained
in the paper indicate that the model of working capital optimization
with concurrent use of multiple supply chain finance solutions can provide
an optimal solution for all the cases considered in the research. It allows
to decrease the total financial costs on working capital and supply chain
finance solutions making individual ones not worse and at the same time
achieve greater liquidity.2021-10-01T00:00:00ZComputation Problems for Envy Stable Solutions of Allocation Problems with Public ResourcesNaumova, Natalia I.http://hdl.handle.net/11701/337042021-11-29T20:41:25Z2021-10-01T00:00:00ZНазвание: Computation Problems for Envy Stable Solutions of Allocation Problems with Public Resources
Авторы: Naumova, Natalia I.
Краткий осмотр (реферат): We consider generalizations of TU games with restricted cooperation
in partition function form and propose their interpretation as allocation
problems with several public resources. Either all resources are goods or all
resources are bads. Each resource is distributed between points of its set and
permissible coalitions are subsets of the union of these sets. Each permissible
coalition estimates each allocation of resources by its gain/loss function, that
depends only on the restriction of the allocation on that coalition. A solution
concept of "fair" allocation (envy stable solution) was proposed by the author
in (Naumova, 2019). This solution is a simplification of the generalized
kernel of cooperative games and it generalizes the equal sacrifice solution for
claim problems. An allocation belongs to this solution if there do not exist
special objections at this allocation between permissible coalitions. For several
classes of such problems we describe methods for computation selectors
of envy stable solutions.2021-10-01T00:00:00ZOn the Existence and Determining Stationary Nash Equilibria for Switching Controller Stochastic GamesLozovanu, DmitriiPickl, Stefanhttp://hdl.handle.net/11701/337032021-11-29T20:35:09Z2021-10-01T00:00:00ZНазвание: On the Existence and Determining Stationary Nash Equilibria for Switching Controller Stochastic Games
Авторы: Lozovanu, Dmitrii; Pickl, Stefan
Краткий осмотр (реферат): In this paper we consider the problem of the existence and determining
stationary Nash equilibria for switching controller stochastic games
with discounted and average payoffs. The set of states and the set of actions
in the considered games are assumed to be finite. For a switching controller
stochastic game with discounted payoffs we show that all stationary equilibria
can be found by using an auxiliary continuous noncooperative static game
in normal form in which the payoffs are quasi-monotonic (quasi-convex and
quasi-concave) with respect to the corresponding strategies of the players.
Based on this we propose an approach for determining the optimal stationary
strategies of the players. In the case of average payoffs for a switching controller
stochastic game we also formulate an auxiliary noncooperative static
game in normal form with quasi-monotonic payoffs and show that such a
game possesses a Nash equilibrium if the corresponding switching controller
stochastic game has a stationary Nash equilibrium.2021-10-01T00:00:00ZDynamic Shapley Value in the Game with Perishable GoodsYin, LiPetrosian, OvanesJinying, Zouhttp://hdl.handle.net/11701/337022021-11-29T20:31:13Z2021-10-01T00:00:00ZНазвание: Dynamic Shapley Value in the Game with Perishable Goods
Авторы: Yin, Li; Petrosian, Ovanes; Jinying, Zou
Краткий осмотр (реферат): The paper investigates two-stage stochastic minimum spanning
tree games with perishable goods. The cooperative behaviour of the players
is defined. At each stage, all players jointly take action to construct a network
with a cost matrix. At the second stage, a particular player may leave
the game, and the probability of this leaving depends on the cooperative
behaviour of all players at the first stage. At each stage game, the total cost
of the spanning tree is calculated to include the sum of the costs of the contained
edges and the cost of the loss of perishable goods expended on that
edge of the spanning tree. The characteristic functions in the game are considered,
and the dynamic Shapley values are modified. The time consistency
of the dynamic Shapley values is studied.2021-10-01T00:00:00ZImplementation of Subgame-Perfect Cooperative Agreement in an Extensive-Form GameKuzyutin, DenisSkorodumova, YuliaSmirnova, Nadezhdahttp://hdl.handle.net/11701/337012021-11-29T20:25:21Z2021-10-01T00:00:00ZНазвание: Implementation of Subgame-Perfect Cooperative Agreement in an Extensive-Form Game
Авторы: Kuzyutin, Denis; Skorodumova, Yulia; Smirnova, Nadezhda
Краткий осмотр (реферат): A novel approach to sustainable cooperation called subgameperfect
core (S-P Core) was introduced by P. Chander and M. Wooders in
2020 for n-person extensive-form games with terminal payoffs. This solution
concept incorporates both subgame perfection and cooperation incentives
and implies certain distribution of the total players' payoff at the terminal
node of the cooperative history. We use in the paper an extension of the S-P
Core to the class of extensive games with payoffs defined at all nodes of the
game tree that is based on designing an appropriate payoff distribution procedure
β and its implementation when a game unfolds along the cooperative
history. The difference is that in accordance with this so-called β-subgameperfect
core the players can redistribute total current payoff at each node
in the cooperative path. Moreover, a payoff distribution procedure from the
β-S-P Core satisfies a number of good properties such as subgame efficiency,
non-negativity and strict balance condition.
In the paper, we examine different properties of the β-S-P Core, introduce
several refinements of this cooperative solution and provide examples of its
implementation in extensive-form games. Finally, we consider an application
of the β-S-P Core to the symmetric discrete-time alternating-move model of
fishery management.2021-10-01T00:00:00ZInformation Collecting and Dissemination in the Network of Taxpayers: Bayesian ApproachKumacheva, Suriya Sh.Tomilina, Galina A.http://hdl.handle.net/11701/337002021-11-28T01:09:21Z2021-10-01T00:00:00ZНазвание: Information Collecting and Dissemination in the Network of Taxpayers: Bayesian Approach
Авторы: Kumacheva, Suriya Sh.; Tomilina, Galina A.
Краткий осмотр (реферат): The current research is based on the assumption that the result
of tax inspections is not only collection of taxes and fines. The information
about audited taxpayers is also collected and helps to renew a priori knowledge
of each agent's evasion propensity and obtain new a posteriori estimate
of this propensity. In the beginning of the following tax period the fiscal authority
can correct auditing strategy using updated information on every
taxpayer. Each inspection is considered as a repeated game, in which the
choice of agents to audit is associated with their revealed tendency to evade.
Taxpayers also renew the information on the number of inspected neighbors
using their social connections, represented by networks of various con gurations,
and estimate the probability of auditing before the next tax period.
Thus, the application of the Bayesian approach to the process of collecting
and disseminating information in the network of taxpayers allows to optimize
the audit scheme, reducing unnecessary expenses of tax authority and
eventually increasing net tax revenue. To illustrate the application of the
approach described above to the indicated problem, numerical simulation
and scenario analysis were carried out.2021-10-01T00:00:00Z