Search results
Results: 173
Number of items: 173
-
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 -
Ottens, B., & Endriss, U. (2008). Comparing winner determination algorithms for mixed multi-unit combinatorial auctions. 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. 1601-1604). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS). http://portal.acm.org/citation.cfm?id=1402821.1402935&coll=GUIDE&dl=GUIDE&type=series&idx=SERIES134&part=series&WantType=Proceedings&title=AGENTS&CFID=20237694&CFTOKEN=81691640 -
Endriss, U., Lang, J., Rossi, F., & Sandholm, T. (Eds.) (2007). Computational Issues in Social Choice: Dagstuhl seminar : abstracts collection. (Dagstuhl Seminar Proceedings; Vol. 07431). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. http://drops.dagstuhl.de/opus/volltexte/2007/1273/
-
Cerquides, J., Endriss, U., Giovannucci, A., & Rodríguez-Aguilar, J. A. (2007). Bidding Languages and Winner Determination for Mixed Multi-unit Combinatorial Auctions. In Veloso, M. (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007) (pp. 1221-1226).
Page 15 of 18