Article
Strategic analysis of the Russian crab quota auction in 2019
The distribution of natural resources such as fish or forest, among many others, is an everyday political, economic, and ecological issue. Auctions are a possible alternative for grandfathering (historical rights). As many economists believe, an auction is the most efficient procedure to distribute quotas for resources. In 2019, the auction for Russian crab quotas yielded the largest revenue (more than 2 bln. euros) among world auctions, except for spectrum auctions. We analyse the strategic behavior of its participants and propose a better scheme of auction which is more favorable for newcomers and small companies, and potentially generates more revenue (up to 40% on 19 out of 31 lots) for the government.
In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were studied in Agrawal ’17, Aravind et al. ’16, Choudhari and Reddy ’18, Misra and Reddy ’17. Main focus of our work is lower bounds on the computational complexity of these problems. Established lower bounds can be divided into the following groups: NP-hardness of the above guarantee parameterization, kernelization lower bounds (answering questions of Misra and Reddy ’17), exponential lower bounds under the Set Cover Conjecture and the Exponential Time Hypothesis, and inapproximability results. Moreover, we present an O∗(ℓk)O∗(ℓk) randomized algorithm for MHV and an O∗(2k)O∗(2k) algorithm for MHE, where ℓℓ is the number of colors used and k is the number of required happy vertices or edges. These algorithms cannot be improved to subexponential taking proved lower bounds into account.
This book is devoted to game theory and its applications to environmental problems, economics, and management. It collects contributions originating from the 12th International Conference on “Game Theory and Management” 2018 (GTM2018) held at Saint Petersburg State University, Russia, from 27 to 29 June 2018.
This contributed volume presents the state-of-the-art of games and dynamic games, featuring several chapters based on plenary sessions at the ISDG-China Chapter Conference on Dynamic Games and Game Theoretic Analysis, which was held from August 3-5, 2017 at the Ningbo campus of the University of Nottingham, China. The chapters in this volume will provide readers with paths to further research, serving as a testimony to the vitality of the field. Experts cover a range of theory and applications related to games and dynamic games.
This paper discusses the scientific and practical perspectives of using general game playing in business-to-business price negotiations as a part of Procurement 4.0 revolution. The status quo of digital price negotiations software, which emerged from intuitive solutions to business goals and refereed to as electronic auctions in industry, is summarized in a scientific context. Description of such aspects as auctioneers’ interventions, asymmetry among players and time- depended features reveals the nature of nowadays electronic auctions to be rather termed as price games. This paper strongly suggests general game playing as the crucial technology for automation of human rule setting in those games. Game theory, genetic programming, experimental economics, and AI human player simulation are also discussed as satellite topics. SIDL-type game descriptions languages and their formal game-theoretic foundations are presented.
We use the vertical differentiation framework to explore the quality - price competition in the insurance market.
The paper is devoted to theoretical research of interrelated instruments of stakeholders system analysis and their interests, as well as a certain sequence of their usage. The studied instruments were applied in practice to solve the problem of inefficient logistics of LLC «Lyra».
The article present of a model of sustainable development of the largest companies in the region and in the territory. The model allows evaluating the sustainable character of a company's development through comparison of the planned and real data, and to discover its non-balanced dynamics.
Game theory has recently become a useful tool for modeling and studying various networks. The past decade has witnessed a huge explosion of interest in issues that intersect networks and game theory. With the rapid growth of data traffic, from any kind of devices and networks, game theory is requiring more intelligent transformation. Game theory is called to play a key role in the design of new generation networks that are distributed, self-organizing, cooperative, and intelligent. This book consists of invited and technical papers of GAMENETS 2018, and contributed chapters on game theoretic applications such as networks, social networks, and smart grid.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traffic is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the final node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a finite-dimensional system of differential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of differential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.