|
|
|
|
|
Davide Bilò, Luciano Gualà, Stefano Leucci and Guido Proietti
Network creation games have been extensively used as mathematical models to capture the key aspects of the decentralized process that leads to the formation of interconnected communication networks by selfish agents. In these games, each user of the netw...
ver más
|
|
|
|
|
|
|
|
|
Yaxi Pan, Ling Zhang and Duan Huang
As the existence of non-zero reflection coefficients in the real component of continuous-variable quantum key distribution (CV-QKD) systems, Eve can probe the system by sending the bright light pulses into Alice?s set-up. With the analysis of back-reflec...
ver más
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov, Natalja M. Matsveichuk and Vadzim D. Hatsura
We study two-machine shop-scheduling problems provided that lower and upper bounds on durations of n jobs are given before scheduling. An exact value of the job duration remains unknown until completing the job. The objective is to minimize the makespan ...
ver más
|
|
|
|
|
|
|
|
|
Vittorio Bilò, Michele Flammini, Vasco Gallotti and Cosimo Vinci
We introduce multidimensional congestion games, that is, congestion games whose set of players is partitioned into ??+1
d
+
1
clusters ??0,??1,?,????
C
0
,
C
1
,
?
,
C
d
. Players in ??0
C
0
have full information about all the other participants in the...
ver más
|
|
|
|
|
|
|
|
|
Tsuyoshi Gotoh, Yuichi Sudo, Fukuhito Ooshita and Toshimitsu Masuzawa
The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems. While the explor...
ver más
|
|
|
|