The object of study in the recent theory of Mean Field Games has been primarily large populations of agents interacting through a population dependent coupli...

The distance, distance Laplacian and distance signless Laplacian spectra of a connected graph \(G\) are the spectra of the distance, distance Laplacian and...

The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 ...

Given a complete directed graph \(G\) with weights on the vertices and on the arcs, a \(\theta\)-improper \(k\)-coloring of \(G\) is an assignment of...

In the present paper we are interested in the study of the distance Laplacian eigenvalues of a connected graph with fixed order \(n\) and chromatic number ...

The maximum \(k\)-colorable subgraph problem (\(k\)-MCSP) is to color as many vertices as possible with at most \(k\) colors, such that no two adjacent...

Network characterization and modelling is an important issue to understand and monitor IP network performance, in particular for real-time multimedia appli...

We consider a dynamic collective choice problem where a large number of players are cooperatively choosing between multiple destinations while being influenc...

In this paper we consider an interactive communication system with two users, who sequentially observe two correlated sources, and send the quantized observa...

The geometric-arithmetic index \(GA\) of a graph \(G\) is the sum of ratios, over all edges of \(G\), of the geometric mean to the arithmetic mean of t...

In the present paper, we prove lower and upper bounds for each of the ratios \(GA/\delta\), \(GA/\overline{d}\) and \(\Delta\), in terms of the order `...

In the present paper, we compare the geometric-arithmetic index \(GA\) and the chromatic number \(\chi\) of a connected graph with given order. We prove,...

Inspired by successful biological collective decision mechanisms such as honey bees searching for a new colony or the collective navigation of fish schoo...

The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to satisfy the demands of customers that can be visited...

Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a...

In this paper, we investigate team optimal control of a population of heterogeneous LQ (Linear Quadratic) agents. The population consists of finite distinct...

In this paper, we tackle the aircraft conflict resolution problem under uncertainties. We consider errors due to the wind effect, the imprecision on the airc...

In this article, we tackle the conflict resolution problem using a new variant of the minimum weight maximum clique model. The problem consists in identifyi...

We consider a multi-agent system with linear stochastic individual dynamics, and individual linear quadratic ergodic cost functions. The agents partially o...

Decentralized sequential hypothesis testing refers to a generalization of Wald's sequential hypothesis testing setup in which multiple decision makers make ...