Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches

Cite

Text

Fujishima et al. "Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Fujishima et al. "Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/fujishima1999ijcai-taming/)

BibTeX

@inproceedings{fujishima1999ijcai-taming,
  title     = {{Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches}},
  author    = {Fujishima, Yuzo and Leyton-Brown, Kevin and Shoham, Yoav},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {548-553},
  url       = {https://mlanthology.org/ijcai/1999/fujishima1999ijcai-taming/}
}