An efficient approximate algorithm for winner determination in combinatorial auctions

Yuko Sakurai; Makoto Yokoo; Koji Kamei

doi:10.1007/3-540-45349-0_47

An efficient approximate algorithm for winner determination in combinatorial auctions

Yuko Sakurai, Makoto Yokoo, Koji Kamei

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings
Editors	Rina Dechter
Publisher	Springer Verlag
Pages	549-553
Number of pages	5
ISBN (Print)	3540410538, 9783540410539
DOIs	https://doi.org/10.1007/3-540-45349-0_47
Publication status	Published - 2000
Externally published	Yes
Event	6th International Conference on Principles and Practice of Constraint Programming, CP2000 - Singapore, Singapore Duration: Sept 18 2000 → Sept 21 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1894
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	6th International Conference on Principles and Practice of Constraint Programming, CP2000
Country/Territory	Singapore
City	Singapore
Period	9/18/00 → 9/21/00

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45349-0_47

Cite this

Sakurai, Y., Yokoo, M., & Kamei, K. (2000). An efficient approximate algorithm for winner determination in combinatorial auctions. In R. Dechter (Ed.), Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings (pp. 549-553). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1894). Springer Verlag. https://doi.org/10.1007/3-540-45349-0_47

An efficient approximate algorithm for winner determination in combinatorial auctions. / Sakurai, Yuko; Yokoo, Makoto; Kamei, Koji.
Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings. ed. / Rina Dechter. Springer Verlag, 2000. p. 549-553 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1894).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sakurai, Y, Yokoo, M & Kamei, K 2000, An efficient approximate algorithm for winner determination in combinatorial auctions. in R Dechter (ed.), Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1894, Springer Verlag, pp. 549-553, 6th International Conference on Principles and Practice of Constraint Programming, CP2000, Singapore, Singapore, 9/18/00. https://doi.org/10.1007/3-540-45349-0_47

Sakurai Y, Yokoo M, Kamei K. An efficient approximate algorithm for winner determination in combinatorial auctions. In Dechter R, editor, Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings. Springer Verlag. 2000. p. 549-553. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45349-0_47

Sakurai, Yuko ; Yokoo, Makoto ; Kamei, Koji. / An efficient approximate algorithm for winner determination in combinatorial auctions. Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings. editor / Rina Dechter. Springer Verlag, 2000. pp. 549-553 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{43fd247860234a659e48d61989860645,

title = "An efficient approximate algorithm for winner determination in combinatorial auctions",

author = "Yuko Sakurai and Makoto Yokoo and Koji Kamei",

year = "2000",

doi = "10.1007/3-540-45349-0_47",

language = "English",

isbn = "3540410538",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "549--553",

editor = "Rina Dechter",

booktitle = "Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings",

address = "Germany",

note = "6th International Conference on Principles and Practice of Constraint Programming, CP2000 ; Conference date: 18-09-2000 Through 21-09-2000",

}

TY - GEN

T1 - An efficient approximate algorithm for winner determination in combinatorial auctions

AU - Sakurai, Yuko

AU - Yokoo, Makoto

AU - Kamei, Koji

PY - 2000

Y1 - 2000

UR - http://www.scopus.com/inward/record.url?scp=84945976253&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945976253&partnerID=8YFLogxK

U2 - 10.1007/3-540-45349-0_47

DO - 10.1007/3-540-45349-0_47

M3 - Conference contribution

AN - SCOPUS:84945976253

SN - 3540410538

SN - 9783540410539

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 549

EP - 553

BT - Principles and Practice of Constraint Programming - CP 2000 - 6th International Conference, CP 2000, Proceedings

A2 - Dechter, Rina

PB - Springer Verlag

T2 - 6th International Conference on Principles and Practice of Constraint Programming, CP2000

Y2 - 18 September 2000 through 21 September 2000

ER -

An efficient approximate algorithm for winner determination in combinatorial auctions

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Cite this