[HTML][HTML] Preferences in AI: An overview
This editorial of the special issue “Representing, Processing, and Learning Preferences:
Theoretical and Practical Challenges” surveys past and ongoing research on preferences in …
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 …
interact with each other. These agents are considered to be autonomous entities such as …
[PDF][PDF] Stanford encyclopedia of philosophy
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 …
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 …
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 …
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
Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …
Computational social choice
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 …
the preferences of multiple agents. Examples of such methods include voting procedures …
[PDF][PDF] Computational aspects of multi-winner approval voting
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 …
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 …
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 …
some cases it is impractical for an agent to give a linear order over all the alternatives. It has …