Brief announcement: on the expected overpayment of VCG mechanisms in large networks

Authors:
David Karger;Evdokia Nikolova
Affiliations:
Massachusetts Institute of Technology;Massachusetts Institute of Technology
Venue:
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Year:
2005

A BGP-based mechanism for lowest-cost routing

Proceedings of the twenty-first annual symposium on Principles of distributed computing
On Certain Connectivity Properties of the Internet Topology

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the expected payment of mechanisms for task allocation

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

Frugal path mechanisms

ACM Transactions on Algorithms (TALG)
Average-Case Analyses of Vickrey Costs

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
First-passage percolation on a width-2 strip and the path cost in a VCG auction

WINE'06 Proceedings of the Second international conference on Internet and Network Economics

Hi-index	0.00