A Modified Vickrey Auction with Regret Minimization for Uniform Alliance Decisions (bibtex)
@incollection{Lujak2018,
	Abstract = {We consider a supply chain management problem where a business alliance of small capacity retailers needs to collectively select a unique supplier considering the assignment's efficiency at both the alliance and retailers' level. We model the alliance as a multi-agent system. For this model, we present a modified Vickrey auction algorithm with regret minimization and compare it experimentally with aggregation of preferences by voting and standard Vickrey auction. Through simulation, we show that the proposed method on average reaches globally efficient and individually acceptable solutions. The solutions are evaluated in terms of different social welfare values.},
	Address = {Cham},
	Author = {Lujak, M. and Slavkovik, M.},
	Booktitle = {Intelligent Distributed Computing XI},
	Doi = {10.1007/978-3-319-66379-1_6},
	Editor = {Ivanovi{\'{c}}, M. and B{\u{a}}dic{\u{a}}, C. and Dix, J and Jovanovi{\'{c}}, Z. and Malgeri, M. and Savi{\'{c}}, M.},
	Isbn = {978-3-319-66379-1},
	Pages = {61--72},
	Publisher = {Springer International Publishing},
	Title = {A Modified Vickrey Auction with Regret Minimization for Uniform Alliance Decisions},
	Url = {https://doi.org/10.1007/978-3-319-66379-1_6},
	Year = {2018},
	Bdsk-Url-1 = {https://doi.org/10.1007/978-3-319-66379-1_6}}
Powered by bibtexbrowser