# A truthful mechanism for the non-utilitarian minimum radius spanning tree problem

@inproceedings{Proietti2005ATM, title={A truthful mechanism for the non-utilitarian minimum radius spanning tree problem}, author={Guido Proietti and Peter Widmayer}, booktitle={SPAA}, year={2005} }

- Published in SPAA 2005
DOI:10.1145/1073970.1073999

Let a communication network be modelled by a graph <i>G</i>=(<i>V</i>,<i>E</i>) of <i>n</i> nodes and <i>m</i> edges. Classic communication operations among nodes in the graph (e.g., broadcasting, multicasting, gossiping, etc.) usually take place on a subgraph of <i>G</i>, which is built in such a way that a given objective function is optimized. Among the many possible topologies of such a subgraph, the <i>minimum radius spanning tree</i> (MRST) is a rooted tree which minimizes the distance… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-5 OF 5 CITATIONS

## Fast payment schemes for truthful mechanisms with verification

VIEW 17 EXCERPTS

CITES METHODS & BACKGROUND

HIGHLY INFLUENCED

## Strongly polynomial-time truthful mechanisms in one shot

VIEW 9 EXCERPTS

CITES BACKGROUND & METHODS

## Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions

VIEW 1 EXCERPT

CITES BACKGROUND

## Approximate Mechanisms for the Graphical TSP and Other Graph Traversal Problems

VIEW 1 EXCERPT

CITES BACKGROUND

## Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-2 OF 2 REFERENCES

## Truthful mechanisms for one-parameter agents

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## Algorithmic Mechanism Design

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL