Vladimir Mazalov - Academia.edu (original) (raw)

Uploads

Papers by Vladimir Mazalov

Abstract We consider the processor load balancing game with different processors. Players choose ... more Abstract We consider the processor load balancing game with different processors. Players choose processors of different speeds to run their jobs striving to minimize job's delay, i.e., the job completion time on a chosen machine. The social cost is the maximum delay over all processors. In the general case and the special case of 3 machines, we obtain upper estimates for the price of anarchy (PoA) and demonstrate when they coincide with the exact values. Moreover, sufficient conditions for PoA increase are established under new machine inclusion into the system. And finally, we propose a computing algorithm of the exact PoA value in the three-processor model.

Journal of the Operations Research Society of China, Apr 21, 2023

Abstract In this chapter we consider the competition model on a transportation network. That is a... more Abstract In this chapter we consider the competition model on a transportation network. That is a market where the customers are distributed in the nodes of a transportation graph. The nodes of the graph represent the hubs (bus stops, airports, railway stations, etc.) while its edges correspond to the transportation links (railways, car, air lines, etc.). The customers in a node are the passengers who use this kind of transportation. The demand is determined by the passenger traffic. There are n companies (players) delivering a service in the market. Each player has some units of a resource. He distributes the resource among links of the graph. The game has three stages as follows [35] . The players simultaneously distribute their resources among the links of the graph. Then the players simultaneously announce the prices for their resources. After that the customers choose a preferable service and the players obtain the payoffs depending on their transportation networks and prices. For the service market over the transportation graph we will construct a Nash equilibrium in the allocation game and also in the pricing game. We demonstrate how it can be used for modeling of air transportation market.

arXiv (Cornell University), Nov 9, 2015

This paper considers the ranking problem of candidates for a certain position based on ballot pap... more This paper considers the ranking problem of candidates for a certain position based on ballot papers filled by voters. We suggest a ranking procedure of alternatives using cooperative game theory methods. For this, it is necessary to construct a characteristic function via the filled ballot paper profile of voters. The Shapley value serves as the ranking method. The winner is the candidate having the maximum Shapley value. And finally, we explore the properties of the designed ranking procedure.

Lecture Notes in Computer Science, 2022

International Journal of Game Theory, May 13, 2019

Computational Social Networks, Oct 28, 2018

Community detection in networks is a very important topic which has numerous applications in soci... more Community detection in networks is a very important topic which has numerous applications in social network analysis, computer science, telecommunications, and bioinformatics and has attracted the effort of many researchers. In the present work, we consider the framework of crisp community detection or network partitioning, where one would like to partition a network into disjoint sets of nodes. The consideration of overlapping, hierarchical, and local clustering we leave for future research. Even the literature on crisp community detection is huge. We refer to several extensive survey papers [1-6]. Let us just mention main classes of methods for network partitioning. The first very large class is based on spectral elements of the network matrices such as adjacency matrix and Laplacian (see e.g., the surveys [1, 5] and references therein). The second class of methods is based on the use of random walks (see e.g., [7-12] for the most representative works in this research direction). The third class of approaches to network partitioning is based on the optimization of some objective function [13-19], with modularity function [15, 16] as a notable example in this category. Finally, the fourth class, directly related to the present work, is based on the notions from game theory. We recommend to an interested reader a recent survey [4] on the application of game-theoretic techniques

Mathematics

This paper considers a callback single-server system with an orbit and a First-Come First-Served ... more This paper considers a callback single-server system with an orbit and a First-Come First-Served (FCFS) service discipline. Customers (users, clients) that encounter a busy server are sent into orbit and then have the option to retry service after an exponential period of time. In addition, each customer entering the system uses a strategy and must independently decide when to arrive in the system within a fixed admission period of time so that the expected sojourn time is minimal. We interpret the arrival process as a Nash equilibrium solution of a noncooperative game when the arrival intensity is completely described by an unknown distribution function, and then we propose a way to find an equilibrium for the case when the client’s waiting time for service is obviously limited. The analytical solution for the equilibrium is illustrated numerically for two-person and three-person games.

Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes

A method of ranking the corpus of texts of a news portal, based on measures of graph centrality, ... more A method of ranking the corpus of texts of a news portal, based on measures of graph centrality, is proposed. Each text is assigned a vertex of a certain graph, and its structure is determined based on the semantic connectivity of the texts. As a measure of centrality, the Myerson value is used in a cooperative game on a graph, where the number of simple paths in a subgraph of a certain length m is chosen as a characteristic function For different values of m, the ranking based on the Myerson value will be different. For the final ranking, it is proposed to use the ranking procedure based on the tournament matrix. The operation of the ranking algorithm is illustrated by numerical examples related to a specific news porta.

Mathematics, 2021

We consider a cooperative packing game in which the characteristic function is defined as the max... more We consider a cooperative packing game in which the characteristic function is defined as the maximum number of independent simple paths of a fixed length included in a given coalition. The conditions under which the core exists in this game are established, and its form is obtained. For several particular graphs, the explicit form of the core is presented.

Optimization Letters, 2022

All in-text references underlined in blue are linked to publications on ResearchGate, letting you... more All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

Non-coalition non-zero-sum game related with arbitration procedure is considered. Two players (fi... more Non-coalition non-zero-sum game related with arbitration procedure is considered. Two players (firlns) propose backslashSOIiotaiotae\backslash SOI\iota\iota ebackslashSOIiotaiotae solutions on the plane. The arbtrator has his own solution which is inodelling by random variables in the circle on the plane. As a solution of the conflict we use here the final offer arbitration procedure (FOA). The objective is the construction of Nash equilibrium. For two cases of thc random solution of the arbitrator we found the equilibrium in pure stratcgics.