On the Approximability of Combinatorial Exchange Problems

A. Briest, P. Krysta, M. Babaioff, in: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), Cham, 2008.

Download
No fulltext has been uploaded.
Conference Paper | Published | English
Author
; ;
Publishing Year
Proceedings Title
Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)
LibreCat-ID

Cite this

Briest A, Krysta P, Babaioff M. On the Approximability of Combinatorial Exchange Problems. In: Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham; 2008. doi:https://doi.org/10.1007/978-3-540-79309-0_9
Briest, A., Krysta, P., & Babaioff, M. (2008). On the Approximability of Combinatorial Exchange Problems. In Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham. https://doi.org/10.1007/978-3-540-79309-0_9
@inproceedings{Briest_Krysta_Babaioff_2008, place={Cham}, title={On the Approximability of Combinatorial Exchange Problems}, DOI={https://doi.org/10.1007/978-3-540-79309-0_9}, booktitle={Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT)}, author={Briest, Argyrios and Krysta, Piotr and Babaioff, Moshe}, year={2008} }
Briest, Argyrios, Piotr Krysta, and Moshe Babaioff. “On the Approximability of Combinatorial Exchange Problems.” In Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT). Cham, 2008. https://doi.org/10.1007/978-3-540-79309-0_9.
A. Briest, P. Krysta, and M. Babaioff, “On the Approximability of Combinatorial Exchange Problems,” in Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008.
Briest, Argyrios, et al. “On the Approximability of Combinatorial Exchange Problems.” Proceedings of the 1st International Symposium on Algorithmic Game Theory (SAGT), 2008, doi:https://doi.org/10.1007/978-3-540-79309-0_9.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar