An Improved Protocol for Securely Solving the Shortest Path Problem and its Application to Combinatorial Auctions.
Abdelrahaman AlySara CleemputPublished in: IACR Cryptol. ePrint Arch. (2017)
Keyphrases
- combinatorial auctions
- shortest path problem
- shortest path
- single source
- false name bids
- resource allocation
- winner determination
- interval data
- auction protocol
- single item
- mechanism design
- multi item
- directed graph
- approximation algorithms
- multi unit
- multi unit combinatorial auctions
- combinatorial optimization problems
- multiple objectives
- auction mechanisms
- special case
- multi objective
- directed acyclic graph
- np hard
- mathematical programming
- combinatorial optimization
- metaheuristic
- decision makers
- optimization problems
- lower bound