Skip to main content
Conference Proceedings

A combinatorial auction framework for solving decentralized scheduling problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5015 LNCS 333-337
DOI: 10.1007/978-3-540-68155-7_33
0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Lau, H. C., Lye, K. W., & Nguyen, V. B. (2008). A combinatorial auction framework for solving decentralized scheduling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 333–337). https://doi.org/10.1007/978-3-540-68155-7_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free