Pub Date : 2020-04-03DOI: 10.1609/AAAI.V34I05.6201
E. Eiben, R. Ganian, Thekla Hamm, S. Ordyniak
We consider the classical problem of allocating resources among agents in an envy-free (and, where applicable, proportional) way. Recently, the basic model was enriched by introducing the concept of a social network which allows to capture situations where agents might not have full information about the allocation of all resources. We initiate the study of the parameterized complexity of these resource allocation problems by considering natural parameters which capture structural properties of the network and similarities between agents and items. In particular, we show that even very general fragments of the considered problems become tractable as long as the social network has bounded treewidth or bounded clique-width. We complement our results with matching lower bounds which show that our algorithms cannot be substantially improved.
{"title":"Parameterized Complexity of Envy-Free Resource Allocation in Social Networks","authors":"E. Eiben, R. Ganian, Thekla Hamm, S. Ordyniak","doi":"10.1609/AAAI.V34I05.6201","DOIUrl":"https://doi.org/10.1609/AAAI.V34I05.6201","url":null,"abstract":"We consider the classical problem of allocating resources among agents in an envy-free (and, where applicable, proportional) way. Recently, the basic model was enriched by introducing the concept of a social network which allows to capture situations where agents might not have full information about the allocation of all resources. We initiate the study of the parameterized complexity of these resource allocation problems by considering natural parameters which capture structural properties of the network and similarities between agents and items. In particular, we show that even very general fragments of the considered problems become tractable as long as the social network has bounded treewidth or bounded clique-width. We complement our results with matching lower bounds which show that our algorithms cannot be substantially improved.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"9 1","pages":"103826"},"PeriodicalIF":0.0,"publicationDate":"2020-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78919528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1016/J.ARTINT.2019.04.001
P. Bonatti
{"title":"Rational closure for all description logics","authors":"P. Bonatti","doi":"10.1016/J.ARTINT.2019.04.001","DOIUrl":"https://doi.org/10.1016/J.ARTINT.2019.04.001","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"68 1","pages":"197-223"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87016933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1016/J.ARTINT.2019.03.002
Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, M. Yokoo
{"title":"Attachment centrality: Measure for connectivity in networks","authors":"Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, M. Yokoo","doi":"10.1016/J.ARTINT.2019.03.002","DOIUrl":"https://doi.org/10.1016/J.ARTINT.2019.03.002","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"28 1","pages":"151-179"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86982072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-18DOI: 10.1016/J.ARTINT.2021.103504
Robin Manhaeve, Sebastijan Dumancic, Angelika Kimmig, Thomas Demeester, L. D. Raedt
{"title":"Neural probabilistic logic programming in DeepProbLog","authors":"Robin Manhaeve, Sebastijan Dumancic, Angelika Kimmig, Thomas Demeester, L. D. Raedt","doi":"10.1016/J.ARTINT.2021.103504","DOIUrl":"https://doi.org/10.1016/J.ARTINT.2021.103504","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"14 1","pages":"103504"},"PeriodicalIF":0.0,"publicationDate":"2019-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91385721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-17DOI: 10.1609/AAAI.V33I01.33011901
P. Faliszewski, Pasin Manurangsi, Krzysztof Sornat
In the SHIFT-BRIBERY problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters’ preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.
{"title":"Approximation and Hardness of Shift-Bribery","authors":"P. Faliszewski, Pasin Manurangsi, Krzysztof Sornat","doi":"10.1609/AAAI.V33I01.33011901","DOIUrl":"https://doi.org/10.1609/AAAI.V33I01.33011901","url":null,"abstract":"In the SHIFT-BRIBERY problem we are given an election, a preferred candidate, and the costs of shifting this preferred candidate up the voters’ preference orders. The goal is to find such a set of shifts that ensures that the preferred candidate wins the election. We give the first polynomial-time approximation scheme for the case of positional scoring rules, and for the Copeland rule we show strong inapproximability results.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"1 1","pages":"103520"},"PeriodicalIF":0.0,"publicationDate":"2019-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88282073","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Elkind, Jiarui Gan, S. Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris
Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in favor of a preferred candidate by changing the vote counts in some of the voting districts. Afterwards, another party (a defender), which cares about the voters' wishes, demands a recount in a subset of the manipulated districts, restoring their vote counts to their original values. We investigate the resulting Stackelberg game for the case where votes are aggregated using two variants of the Plurality rule, and obtain an almost complete picture of the complexity landscape, both from the attacker's and from the defender's perspective.
{"title":"Protecting Elections by Recounting Ballots","authors":"E. Elkind, Jiarui Gan, S. Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris","doi":"10.24963/ijcai.2019/37","DOIUrl":"https://doi.org/10.24963/ijcai.2019/37","url":null,"abstract":"Complexity of voting manipulation is a prominent topic in computational social choice. In this work, we consider a two-stage voting manipulation scenario. First, a malicious party (an attacker) attempts to manipulate the election outcome in favor of a preferred candidate by changing the vote counts in some of the voting districts. Afterwards, another party (a defender), which cares about the voters' wishes, demands a recount in a subset of the manipulated districts, restoring their vote counts\u0000to their original values. We investigate the resulting Stackelberg game for the case where votes are aggregated using two variants of the Plurality rule, and obtain an almost complete picture of the complexity landscape, both from the attacker's and from the defender's perspective.","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"79 1","pages":"103401"},"PeriodicalIF":0.0,"publicationDate":"2019-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87069247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-03-25DOI: 10.1016/j.artint.2020.103348
Christoph Benzmüller, X. Parent, Leendert van der Torre
{"title":"Designing normative theories for ethical and legal reasoning: LogiKEy framework, methodology, and tool support","authors":"Christoph Benzmüller, X. Parent, Leendert van der Torre","doi":"10.1016/j.artint.2020.103348","DOIUrl":"https://doi.org/10.1016/j.artint.2020.103348","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":"11 4 1","pages":"103348"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77526071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：