Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Open Access
    Endriss, U., Grandi, U., & Porello, D. (2010). Complexity of judgment aggregation: safety of the agenda. In W. van der Hoek, G. A. Kaminka, Y. Lespérance, M. Luck, & S. Sen (Eds.), AAMAS 2010: the 9th International Conference on Autonomous Agents and Multiagent Systems, May 10-14, 2010, Toronto, Canada : conference proceedings (Vol. 1, pp. 359-366). IFAAMAS. https://dl.acm.org/citation.cfm?id=1838257
  • Open Access
    Uckelman, J., & Endriss, U. (2010). Compactly representing utility functions using weighted goals and the max aggregator. Artificial Intelligence, 174(15), 1222-1246. https://doi.org/10.1016/j.artint.2010.07.003
  • Grandi, U., & Endriss, U. (2009). First-order logic formalisation of Arrow’s Theorem. In X. He, J. Horty, & E. Pacuit (Eds.), Logic, Rationality, and Interaction: second international workshop, LORI 2009, Chongqing, China, October 8-11, 2009 : proceedings (pp. 133-146). (Lecture Notes in Computer Science; Vol. 5834), (Lecture Notes in Artificial Intelligence), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-642-04893-7_11
  • Airiau, S., & Endriss, U. (2009). Iterated majority voting. In F. Rossi, & A. Tsoukias (Eds.), Algorithmic Decision Theory: First International Conference, ADT 2009, Venice, Italy, October 20-23, 2009 : proceedings (pp. 38-49). (Lecture Notes in Computer Science; Vol. 5783), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-642-04428-1_4
  • Open Access
    Endriss, U., Pini, M. S., Rossi, F., & Venable, K. B. (2009). Preference aggregation over restricted ballot languages: Sincerity and strategy-proofness. In C. Boutilier (Ed.), IJCAI-09: proceedings of the Twenty-First International Joint Conference on Artificial Intelligence: Pasadena, California, USA, 11-17 July 2009 (pp. 122-127). AAAI Press. http://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/view/364
  • Open Access
    Uckelman, J., Chevaleyre, Y., Endriss, U., & Lang, J. (2009). Representing utility functions via weighted goals. Mathematical Logic Quarterly, 55(4), 341-361. https://doi.org/10.1002/malq.200810024
  • Open Access
    Bouveret, S., Endriss, U., & Lang, J. (2009). Conditional importance networks: A graphical language for representing ordinal, monotonic preferences over sets of goods. In C. Boutilier (Ed.), IJCAI-09: proceedings of the Twenty-First International Joint Conference on Artificial Intelligence: Pasadena, California, USA, 11-17 July 2009 (pp. 67-72). AAAI Press. http://www.aaai.org/ocs/index.php/IJCAI/IJCAI-09/paper/view/547
  • Open Access
    Mancarella, P., Terreni, G., Sadri, F., Toni, F., & Endriss, U. (2009). The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. Theory and Practice of Logic Programming, 9(6), 691-750. https://doi.org/10.1017/S1471068409990093
  • Open Access
    Airiau, S., Endriss, U., & Halpern, J. Y. (2009). Solution to Exchanges 8.1 puzzle: Identifying the champion. SIGecom Exchanges, 8(2). http://www.sigecom.org/exchanges/volume_8/2/airiau.pdf
  • Open Access
    Giovannucci, A., Cerquides, J., Endriss, U., Vinyals, M., Rodriguez, J. A., & Rosell, B. (2009). A mixed multi-unit combinatorial auctions test suite. In K. S. Decker, J. S. Sichman, C. Sierra, & C. Castelfranchi (Eds.), AAMAS 2009: the 8th International Conference on Autonomous Agents and Multiagent Systems: May 10-15, 2009, Budapest, Hungary: proceedings. - Volume 2 (pp. 1389-1390). IFAAMAS. http://portal.acm.org/citation.cfm?id=1558309
Page 13 of 18