Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract)

Cite

Text

Santi et al. "Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract)." Annual Conference on Computational Learning Theory, 2004. doi:10.1007/978-3-540-27819-1_1

Markdown

[Santi et al. "Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract)." Annual Conference on Computational Learning Theory, 2004.](https://mlanthology.org/colt/2004/santi2004colt-characterization/) doi:10.1007/978-3-540-27819-1_1

BibTeX

@inproceedings{santi2004colt-characterization,
  title     = {{Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions (Extended Abstract)}},
  author    = {Santi, Paolo and Conitzer, Vincent and Sandholm, Tuomas},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2004},
  pages     = {1-16},
  doi       = {10.1007/978-3-540-27819-1_1},
  url       = {https://mlanthology.org/colt/2004/santi2004colt-characterization/}
}