We investigate the algorithmic performance of Vickrey-Clarke-Groves mechanisms in the single item case. We provide a formal definition of a Vickrey algorithm for this framework, a...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Restricting the preferences of the agents by assuming that their utility functions linearly depend on a payment allows for the positive results of the Vickrey auction and the Vick...
Paul Harrenstein, Mathijs de Weerdt, Vincent Conit...
—The timeliness of packet delivery is an important performance measure in wireless networks, especially when urgent messages need to be transported through a network. This paper ...