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}
}
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

References

Publications referenced by this paper.
SHOWING 1-2 OF 2 REFERENCES

Truthful mechanisms for one-parameter agents

  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Algorithmic Mechanism Design

  • Games and Economic Behavior
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL