Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem

被引：0
|
作者：
Luciano Gualà
Guido Proietti
机构：
[1] Università di L’Aquila,Dipartimento di Informatica
[2] Università di Tor Vergata,Dipartimento di Matematica
[3] CNR,Istituto di Analisi dei Sistemi ed Informatica “A. Ruberti”
来源：
Algorithmica | 2007年 / 49卷
关键词：
Single-source shortest paths tree; Selfish agents; Algorithmic mechanism design; Truthful mechanisms;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Let a communication network be modeled by an undirected graph G=(V,E) of n nodes and m edges, and assume that edges are controlled by selfish agents. In this paper we analyze the problem of designing a truthful mechanism for computing one of the most popular structures in communication networks, i.e., the single-source shortest paths tree.
引用
收藏
页码：171 / 191
页数：20
相关论文
共 50 条
  • [1] Exact and approximate truthful mechanisms for the shortest paths tree problem
    Guala, Luciano
    Proietti, Guido
    ALGORITHMICA, 2007, 49 (03) : 171 - 191
  • [2] On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
    Bilo, Davide
    Guala, Luciano
    Proietti, Guido
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2006, 4056 : 295 - 309
  • [3] Efficient truthful mechanisms for the single-source shortest paths tree problem
    Guala, L.
    Proietti, G.
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2007, 19 (17): : 2285 - 2297
  • [4] Efficient truthful mechanisms for the single-source shortest paths tree problem
    Gualà, L
    Proietti, G
    EURO-PAR 2005 PARALLEL PROCESSING, PROCEEDINGS, 2005, 3648 : 941 - 951
  • [5] Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
    Czekaj, Jacek
    Socha, Leslaw
    SYSTEM MODELING AND OPTIMIZATION, 2009, 312 : 220 - +
  • [6] APPROXIMATE SHORTEST DESCENDING PATHS
    Cheng, Siu-Wing
    Jin, Jiongxin
    SIAM JOURNAL ON COMPUTING, 2014, 43 (02) : 410 - 428
  • [7] Approximate Shortest Descending Paths
    Cheng, Siu-Wing
    Jin, Jiongxin
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 144 - 155
  • [8] Approximate Shortest Paths in Anisotropic Regions
    Cheng, Siu-Wing
    Na, Hyeon-Suk
    Vigneron, Antoine
    Wang, Yajun
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 766 - +
  • [9] Approximate shortest paths in anisotropic regions
    Cheng, Siu-Wing
    Na, Hyeon-Suk
    Vigneron, Antoine
    Wang, Yajun
    SIAM JOURNAL ON COMPUTING, 2008, 38 (03) : 802 - 824
  • [10] Approximate Shortest Paths in Simple Polyhedra
    Li, Fajie
    Klette, Reinhard
    DISCRETE GEOMETRY FOR COMPUTER IMAGERY, 2011, 6607 : 513 - +
12345