Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
This paper deals with fair assignment problems in decision contexts involving multiple agents. In such problems, each agent has its own evaluation of costs and we want to find a f...
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
Minimax-regret preference elicitation allows intelligent decisions to be made on behalf of people facing risky choices. Standard gamble queries, a vital tool in this type of prefe...