Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A faster strongly polynomial minimum cost flow algorithm
Operations Research
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Truthful and Competitive Double Auctions
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Algorithms for selfish agents mechanism design for distributed computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.01 |
Our research is motivated by finding auction protocols to elegantly coordinate the sellers and buyers when there are multiple auctions. In our model, there are multiple sellers selling different items that are substitute to each other, multiple buyers each demanding exactly one item, and a market that is monopolistic competitive. We implement our auction coordination protocol by polynomial running time algorithms and establishes its incentive compatibleness.