Your search for: 'author:("Loreggia, Andrea")' has returned 2 results. (0.006s) Save search

Authors: Loreggia, Andrea

Article Type: Research Article

Abstract: We analyze two different scenarios, which can be seen as two different sides of the same problem. Multimode control actions have been considered a malicious strategic actions. To protect the election, we study how difficult it is to exploit these actions in a system with equal budgets. In an equal budget configuration, actions have different separated resources, but these have to be used equally. In particular, this can model the replace control action, where the chair has to delete as many candidates/voters as she added. We prove some new results on two well-known voting rules: Plurality and Copeland. The other …studied scenario is iterative voting, which naturally uses manipulation. We study the stability of voting rules not yet considered. We identify some specific restrictions which guarantee that some specific voting rules always converge. After that, we use single and multiple control actions within iterative voting, in order to understand if the malicious side of control can overcome the stability of the iterative voting systems. Show more

Keywords: Voting theory, preference aggregation, computational social choice, multimode control, manipulation, iterative voting, computational complexity

DOI: 10.3233/IA-140059

Citation: Intelligenza Artificiale, vol. 8, no. 1, pp. 39-51, 2014

Authors: Loreggia, Andrea | Calegari, Roberta | Lorini, Emiliano | Rossi, Francesca | Sartor, Giovanni

Article Type: Research Article

Abstract: Preferences are ubiquitous in our everyday life. They are essential in the decision making process of individuals. Recently, they have also been employed to represent ethical principles, normative systems or guidelines. In this work we focus on a ceteris paribus semantics for deontic logic: a state of affairs where a larger set of respected prescriptions is preferable to a state of affairs where some are violated. Conditional preference networks (CP-nets) are a compact formalism to express and analyse ceteris paribus preferences, with some desirable computational properties. In this paper, we show how deontic concepts (such as contrary-to-duty obligations) can be …modeled with generalized CP-nets (GCP-nets) and how to capture the distinction between strong and weak permission in this formalism. To do that, we leverage on an existing restricted deontic logic that will be mapped into conditional preference nets. Show more

Keywords: Deontic logic, GCP-nets, ceteris-paribus semantics, contrary-to-duty, strong and weak permission

DOI: 10.3233/IA-221057

Citation: Intelligenza Artificiale, vol. 16, no. 2, pp. 185-198, 2022