First-passage percolation on a ladder graph, and the path cost in a VCG auction.
Abraham FlaxmanDavid GamarnikGregory B. SorkinPublished in: Random Struct. Algorithms (2011)
Keyphrases
- combinatorial auctions
- mechanism design
- path length
- series parallel
- minimum cost path
- minimum cost
- shortest path
- finding the shortest path
- auction mechanisms
- graph theory
- directed graph
- shortest path problem
- graph representation
- total cost
- solution path
- multiagent systems
- multi unit
- strategy proof
- graph model
- random walk
- question answering
- weighted graph
- spanning tree
- approximation algorithms
- resource allocation
- game theory
- special case
- np hard
- incentive compatibility
- budget constraints
- document retrieval
- cost sensitive
- undirected graph
- online auctions
- directed acyclic graph
- group buying
- structured data
- small world
- bipartite graph
- cooperative