[HTML][HTML] Preferences in AI: An overview

C Domshlak, E Hüllermeier, S Kaci, H Prade - Artificial Intelligence, 2011 - Elsevier
This editorial of the special issue “Representing, Processing, and Learning Preferences:
Theoretical and Practical Challenges” surveys past and ongoing research on preferences in …

[图书][B] An introduction to multiagent systems

M Wooldridge - 2009 - books.google.com
The study of multi-agent systems (MAS) focuses on systems in which many intelligent agents
interact with each other. These agents are considered to be autonomous entities such as …

[PDF][PDF] Stanford encyclopedia of philosophy

EN Zalta, U Nodelman, C Allen, J Perry - 1995 - ruccs.rutgers.edu
Notice: This PDF version was distributed by request to members of the Friends of the SEP
Society and by courtesy to SEP content contributors. It is solely for their fair use …

[PDF][PDF] Stanford encyclopedia of philosophy

EN Zalta, U Nodelman, C Allen… - See http://plato. stanford …, 2002 - academia.edu
After an introductory section, this article will focus on four questions: How should the Kyoto
School be defined? What is meant by its central philosophical concept of “absolute …

Computer science and game theory: A brief survey

JY Halpern - arXiv preprint cs/0703148, 2007 - arxiv.org
There has been a remarkable increase in work at the interface of computer science and
game theory in the past decade. In this article I survey some of the main themes of work in …

Preference restrictions in computational social choice: A survey

E Elkind, M Lackner, D Peters - arXiv preprint arXiv:2205.09092, 2022 - arxiv.org
Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …

Computational social choice

F Brandt, V Conitzer, U Endriss - Multiagent systems, 2012 - books.google.com
Social choice theory concerns the design and formal analysis of methods for aggregating
the preferences of multiple agents. Examples of such methods include voting procedures …

[PDF][PDF] Computational aspects of multi-winner approval voting

H Aziz, S Gaspers, J Gudmundsson… - Workshops at the …, 2014 - cdn.aaai.org
We study computational aspects of three prominent voting rules that use approval ballots to
elect multiple winners. These rules are satisfaction approval voting, proportional approval …

How hard is bribery in elections?

P Faliszewski, E Hemaspaandra… - Journal of artificial …, 2009 - jair.org
We study the complexity of influencing elections through bribery: How computationally
complex is it for an external actor to determine whether by paying certain voters to change …

Determining possible and necessary winners given partial orders

L Xia, V Conitzer - Journal of Artificial Intelligence Research, 2011 - jair.org
Usually a voting rule requires agents to give their preferences as linear orders. However, in
some cases it is impractical for an agent to give a linear order over all the alternatives. It has …