发布求助
文献互助 智能选刊 最新文献

Artif. Intell.最新文献

筛选
英文 中文
Parameterized Complexity of Envy-Free Resource Allocation in Social Networks 社会网络中无嫉妒资源分配的参数化复杂性
Artif. Intell. Pub Date : 2020-04-03 DOI: 10.1609/AAAI.V34I05.6201
E. Eiben, R. Ganian, Thekla Hamm, S. Ordyniak
{"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":null,"pages":null},"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}
引用次数: 12
Convolutional Spectral Kernel Learning 卷积谱核学习
Artif. Intell. Pub Date : 2020-02-28 DOI: 10.1016/j.artint.2022.103803
Jian Li, Yong Liu, Weiping Wang
{"title":"Convolutional Spectral Kernel Learning","authors":"Jian Li, Yong Liu, Weiping Wang","doi":"10.1016/j.artint.2022.103803","DOIUrl":"https://doi.org/10.1016/j.artint.2022.103803","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85585367","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}
引用次数: 0
Rational closure for all description logics 所有描述逻辑的合理闭包
Artif. Intell. Pub Date : 2019-09-01 DOI: 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":null,"pages":null},"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}
引用次数: 26
Attachment centrality: Measure for connectivity in networks 依恋中心性:网络连通性的衡量标准
Artif. Intell. Pub Date : 2019-09-01 DOI: 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":null,"pages":null},"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}
引用次数: 26
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) 2016年和2017年QBF求解器评估(QBFEVAL'16和QBFEVAL'17)
Artif. Intell. Pub Date : 2019-09-01 DOI: 10.1016/J.ARTINT.2019.04.002
Luca Pulina, M. Seidl
{"title":"The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)","authors":"Luca Pulina, M. Seidl","doi":"10.1016/J.ARTINT.2019.04.002","DOIUrl":"https://doi.org/10.1016/J.ARTINT.2019.04.002","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89599764","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}
引用次数: 30
Toward any-language zero-shot topic classification of textual documents 面向任何语言的文本文档零主题分类
Artif. Intell. Pub Date : 2019-09-01 DOI: 10.1016/J.ARTINT.2019.02.002
Yangqiu Song, Shyam Upadhyay, Haoruo Peng, Stephen Mayhew, D. Roth
{"title":"Toward any-language zero-shot topic classification of textual documents","authors":"Yangqiu Song, Shyam Upadhyay, Haoruo Peng, Stephen Mayhew, D. Roth","doi":"10.1016/J.ARTINT.2019.02.002","DOIUrl":"https://doi.org/10.1016/J.ARTINT.2019.02.002","url":null,"abstract":"","PeriodicalId":8496,"journal":{"name":"Artif. Intell.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87624487","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}
引用次数: 11
Neural probabilistic logic programming in DeepProbLog DeepProbLog中的神经概率逻辑编程
Artif. Intell. Pub Date : 2019-07-18 DOI: 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":null,"pages":null},"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}
引用次数: 60
Approximation and Hardness of Shift-Bribery 移位贿赂的逼近性与硬度
Artif. Intell. Pub Date : 2019-07-17 DOI: 10.1609/AAAI.V33I01.33011901
P. Faliszewski, Pasin Manurangsi, Krzysztof Sornat
{"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":null,"pages":null},"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}
引用次数: 13
Protecting Elections by Recounting Ballots 通过重新计票保护选举
Artif. Intell. Pub Date : 2019-06-17 DOI: 10.24963/ijcai.2019/37
E. Elkind, Jiarui Gan, S. Obraztsova, Zinovi Rabinovich, Alexandros A. Voudouris
{"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":null,"pages":null},"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}
引用次数: 12
Designing normative theories for ethical and legal reasoning: LogiKEy framework, methodology, and tool support 为伦理和法律推理设计规范理论:LogiKEy框架、方法和工具支持
Artif. Intell. Pub Date : 2019-03-25 DOI: 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":null,"pages":null},"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}
引用次数: 29
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信