Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Open Access
    Uckelman, J. D. (2009). More than the sum of its parts : compact preference representation over combinatorial domains. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Endriss, U., & Goldberg, P. W. (2008). Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC-2008). University of Liverpool, Department of Computer Science. http://www.csc.liv.ac.uk/~pwg/COMSOC-2008/COMSOC-2008.pdf
  • Open Access
    Chevaleyre, Y., Endriss, U., Estivie, S., & Maudet, N. (2008). Multiagent resource allocation in k-additive domains: Preference representation and complexity. Annals of Operations Research, 163(1), 49-62. https://doi.org/10.1007/s10479-008-0335-0
  • Open Access
    Uckelman, J., & Endriss, U. (2008). Preference modeling by weighted goals with max aggregation. In G. Brewka, & J. Lang (Eds.), Principles of knowledge representation and reasoning: Proceedings of the eleventh international conference (KR 2008) (pp. 579-587). AAAI Press. http://www.aaai.org/Papers/KR/2008/KR08-057.pdf
  • Open Access
    Uckelman, J., & Endriss, U. (2008). Winner determination in combinatorial auctions with logic-based bidding languages. In L. Padgham, D. Parkes, J. Müller, & S. Parsons (Eds.), AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 3 (pp. 1617-1620). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). http://portal.acm.org/citation.cfm?id=1402939
  • Open Access
    Chevaleyre, Y., Endriss, U., & Maudet, N. (2008). Trajectories of goods in distributed allocation. In L. Padgham, D. Parkes, J. Müller, & S. Parsons (Eds.), AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 2 (pp. 1111-1118). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). http://portal.acm.org/citation.cfm?id=1402298.1402375&coll=GUIDE&dl=GUIDE
  • Open Access
    Chevaleyre, Y., Endriss, U., & Maudet, N. (2008). Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality. In V. T. Paschos (Ed.), Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives: 30th Anniversary of the LAMSADE (pp. 175-201). ISTE. https://doi.org/10.1002/9780470611098.ch7
  • Open Access
    Chevaleyre, Y., Endriss, U., Lang, J., & Maudet, N. (2008). Preference handling in combinatorial domains: From AI to social choice. The AI Magazine, 29(4), 37-46. http://www.aaai.org/ojs/index.php/aimagazine/article/view/2201
  • Open Access
    Endriss, U. (2008). Computational Social Choice, 3-5 September. The Reasoner, 2(10), 9-10. https://research.kent.ac.uk/reasoning/wp-content/uploads/sites/581/2019/06/TheReasoner-210.pdf
  • Open Access
    Endriss, U. (2008). The 1st international workshop on computational social choice. Knowledge Engineering Review, 23(2), 213-215. https://doi.org/10.1017/S0269888908001343
Page 14 of 18