Digraph k-Coloring Games: New Algorithms and Experiments

被引:0
|
作者
D'Ascenzo, Andrea [1 ]
D'Emidio, Mattia [2 ]
Flammini, Michele [3 ,4 ]
Monaco, Gianpiero [5 ]
机构
[1] Luiss University, Viale Romania 32, Rome,00197, Italy
[2] Dept. of Information Engineering Computer Science and Mathematics, University of L'Aquila, Via Vetoio snc, L'Aquila,67100, Italy
[3] Dept. of Computer Science, Gran Sasso Science Institute, Viale F. Crispi 7, L'Aquila,67100, Italy
[4] Dept. of Mathematics and Computer Science, University of Calabria, Via P. Bucci, CS, Arcavacata di Rende,87036, Italy
[5] Dept. of Economic Studies, University of Chieti-Pescara, Viale Pindaro, Pescara,65127, Italy
关键词
Preliminary versions of the results presented in this paper have appeared in (Carosi; Flammini; Monaco; 2017; D'Ascenzo; D'Emidio; 2022). Most of Andrea D'Ascenzo's work was carried out during his Ph.D. studies at University of L'Aquila. This work was partially supported by: (i) Italian Ministry of University and Research through Project "EXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data\"" (PRIN grant n. 2022TS4Y3N);
D O I
暂无
中图分类号
学科分类号
摘要
62
引用
收藏
页码:163 / 202
相关论文
共 50 条
  • [1] Digraph k-Coloring Games: New Algorithms and Experiments
    D'Ascenzo, Andrea
    D'Emidio, Mattia
    Flammini, Michele
    Monaco, Gianpiero
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2024, 81 : 163 - 202
  • [2] Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games
    Carosi, Raffaello
    Flammini, Michele
    Monaco, Gianpiero
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 911 - 919
  • [3] Generalized Graph k-Coloring Games
    Carosi, Raffaello
    Monaco, Gianpiero
    COMPUTING AND COMBINATORICS (COCOON 2018), 2018, 10976 : 268 - 279
  • [4] Generalized Graph k-Coloring Games
    Raffaello Carosi
    Gianpiero Monaco
    Theory of Computing Systems, 2020, 64 : 1028 - 1041
  • [5] Generalized Graph k-Coloring Games
    Carosi, Raffaello
    Monaco, Gianpiero
    THEORY OF COMPUTING SYSTEMS, 2020, 64 (06) : 1028 - 1041
  • [6] On the k-coloring of intervals
    Discrete Appl Math, 3 (225):
  • [7] ON THE K-COLORING OF INTERVALS
    CARLISLE, MC
    LLOYD, EL
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 497 : 90 - 101
  • [8] ON THE K-COLORING OF INTERVALS
    CARLISLE, MC
    LLOYD, EL
    DISCRETE APPLIED MATHEMATICS, 1995, 59 (03) : 225 - 235
  • [9] A new graph radio k-coloring algorithm
    Saha, Laxman
    Panigrahi, Pratima
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (01)
  • [10] On the probabilistic minimum coloring and minimum k-coloring
    Murat, U
    Paschos, VT
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 564 - 586