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 条
  • [21] Approximate Shortest Paths Guided by a Small Index
    Jörg Derungs
    Riko Jacob
    Peter Widmayer
    Algorithmica, 2010, 57 : 668 - 688
  • [22] Approximate Shortest Homotopic Paths in Weighted Regions
    Cheng, Siu-Wing
    Jin, Jiongxin
    Vigneron, Antoine
    Wang, Yajun
    ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 109 - +
  • [23] Approximate shortest paths guided by a small index
    Derungs, Joerg
    Jacob, Riko
    Widmayer, Peter
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 553 - +
  • [24] Fast approximate shortest paths in the congested clique
    Keren Censor-Hillel
    Michal Dory
    Janne H. Korhonen
    Dean Leitersdorf
    Distributed Computing, 2021, 34 : 463 - 487
  • [25] Fuzzy Shortest Paths Approximation for Solving the Fuzzy Steiner Tree Problem in Graphs
    Seda, Milos
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 14, 2006, 14 : 22 - 26
  • [26] APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
    Cheng, Siu-Wing
    Jin, Jiongxin
    Vigneron, Antoine
    Wang, Yajun
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2012, 22 (01) : 83 - 102
  • [27] Approximate Shortest Paths Guided by a Small Index
    Derungs, Joerg
    Jacob, Riko
    Widmayer, Peter
    ALGORITHMICA, 2010, 57 (04) : 668 - 688
  • [28] Massively Parallel Algorithms for Approximate Shortest Paths
    Dory, Michal
    Matar, Shaked
    PROCEEDINGS OF THE 36TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2024, 2024, : 415 - 426
  • [29] Fast approximate shortest paths in the congested clique
    Censor-Hillel, Keren
    Dory, Michal
    Korhonen, Janne H.
    Leitersdorf, Dean
    DISTRIBUTED COMPUTING, 2021, 34 (06) : 463 - 487
  • [30] Faster Approximate All Pairs Shortest Paths
    Saha, Barna
    Ye, Christopher
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 4758 - 4827
12345