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

International Symposium on Artificial Intelligence and Mathematics最新文献

筛选
英文 中文
Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota 通过删除或添加玩家来控制加权投票游戏，无论是否改变配额
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2023-07-06 DOI: 10.1007/978-3-031-06678-8_26
Joanna Kaczmarek, J. Rothe
{"title":"Controlling Weighted Voting Games by Deleting or Adding Players with or without Changing the Quota","authors":"Joanna Kaczmarek, J. Rothe","doi":"10.1007/978-3-031-06678-8_26","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_26","url":null,"abstract":"","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114673815","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
A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs 巨图最小顶点覆盖问题的一种基于警告传播的线性时空算法
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2018-06-26 DOI: 10.1007/978-3-319-93031-2_41
Hong Xu, Kexuan Sun, Sven Koenig, T. K. S. Kumar
{"title":"A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs","authors":"Hong Xu, Kexuan Sun, Sven Koenig, T. K. S. Kumar","doi":"10.1007/978-3-319-93031-2_41","DOIUrl":"https://doi.org/10.1007/978-3-319-93031-2_41","url":null,"abstract":"","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132244612","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}
引用次数: 5
Moral Decision Making Frameworks for Artificial Intelligence 人工智能的道德决策框架
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2017-02-04 DOI: 10.1609/aaai.v31i1.11140
Vincent Conitzer, Walter Sinnott-Armstrong, Jana Schaich Borg, Yuan Deng, Max F. Kramer
{"title":"Moral Decision Making Frameworks for Artificial Intelligence","authors":"Vincent Conitzer, Walter Sinnott-Armstrong, Jana Schaich Borg, Yuan Deng, Max F. Kramer","doi":"10.1609/aaai.v31i1.11140","DOIUrl":"https://doi.org/10.1609/aaai.v31i1.11140","url":null,"abstract":"\u0000 \u0000 The generality of decision and game theory has enabled domain-independent progress in AI research. For example, a better algorithm for finding good policies in (PO)MDPs can be instantly used in a variety of applications. But such a general theory is lacking when it comes to moral decision making. For AI applications with a moral component, are we then forced to build systems based on many ad-hoc rules? In this paper we discuss possible ways to avoid this conclusion.\u0000 \u0000","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116699482","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}
引用次数: 145
Decompositions Based on Decision Diagrams 基于决策图的分解
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2016-05-29 DOI: 10.1007/978-3-319-33954-2_4
David Bergman, A. Ciré
{"title":"Decompositions Based on Decision Diagrams","authors":"David Bergman, A. Ciré","doi":"10.1007/978-3-319-33954-2_4","DOIUrl":"https://doi.org/10.1007/978-3-319-33954-2_4","url":null,"abstract":"","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122564486","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}
引用次数: 19
Rules for Choosing Societal Tradeoffs 选择社会权衡的规则
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2016-02-12 DOI: 10.1609/aaai.v30i1.10055
Vincent Conitzer, Rupert Freeman, Markus Brill, Yuqian Li
{"title":"Rules for Choosing Societal Tradeoffs","authors":"Vincent Conitzer, Rupert Freeman, Markus Brill, Yuqian Li","doi":"10.1609/aaai.v30i1.10055","DOIUrl":"https://doi.org/10.1609/aaai.v30i1.10055","url":null,"abstract":"\u0000 \u0000 We study the societal tradeoffs problem, where a set of voters each submit their ideal tradeoff value between each pair of activities (e.g., \"using a gallon of gasoline is as bad as creating 2 bags of landfill trash\"), and these are then aggregated into the societal tradeoff vector using a rule. We introduce the family of distance-based rules and show that these can be justified as maximum likelihood estimators of the truth. Within this family, we single out the logarithmic distance-based rule as especially appealing based on a social-choice-theoretic axiomatization. We give an efficient algorithm for executing this rule as well as an approximate hill climbing algorithm, and evaluate these experimentally.\u0000 \u0000","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125857885","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
On Boosting Sparse Parities 关于提高稀疏奇偶性
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2014-06-21 DOI: 10.1609/aaai.v28i1.9020
L. Reyzin
{"title":"On Boosting Sparse Parities","authors":"L. Reyzin","doi":"10.1609/aaai.v28i1.9020","DOIUrl":"https://doi.org/10.1609/aaai.v28i1.9020","url":null,"abstract":"\u0000 \u0000 While boosting has been extensively studied, considerablyless attention has been devoted to the task of designing good weaklearning algorithms. In this paper we consider the problem of designing weak learners thatare especially adept to the boosting procedure and specifically the AdaBoost algorithm. First we describe conditions desirable for a weak learning algorithm. We then propose using sparse parity functions as weak learners, which have many of our desired properties, as weak learners in boosting. Our experimental tests show the proposed weak learners tobe competitive with the most widely used ones: decisionstumps and pruned decision trees.\u0000 \u0000","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132740256","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}
引用次数: 3
Combinatorial problems for Horn clauses 霍恩子句的组合问题
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2008-12-01 DOI: 10.1007/978-3-642-02029-2_6
Marina Langlois, D. Mubayi, R. Sloan, György Turán
{"title":"Combinatorial problems for Horn clauses","authors":"Marina Langlois, D. Mubayi, R. Sloan, György Turán","doi":"10.1007/978-3-642-02029-2_6","DOIUrl":"https://doi.org/10.1007/978-3-642-02029-2_6","url":null,"abstract":"","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126980666","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
On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability 混合概率逻辑规划与随机可满足性的关系
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2008-10-01 DOI: 10.1007/978-3-540-87993-0_28
Emad Saad
{"title":"On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability","authors":"Emad Saad","doi":"10.1007/978-3-540-87993-0_28","DOIUrl":"https://doi.org/10.1007/978-3-540-87993-0_28","url":null,"abstract":"","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680915","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}
引用次数: 9
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting 利用信念传播、回溯搜索和模型计数统计
International Symposium on Artificial Intelligence and Mathematics Pub Date : 2008-05-20 DOI: 10.1007/978-3-540-68155-7_12
L. Kroc, Ashish Sabharwal, B. Selman
{"title":"Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting","authors":"L. Kroc, Ashish Sabharwal, B. Selman","doi":"10.1007/978-3-540-68155-7_12","DOIUrl":"https://doi.org/10.1007/978-3-540-68155-7_12","url":null,"abstract":"","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123673808","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}
引用次数: 45
Complexity of Control by Partitioning Veto and Maximin Elections 划分否决和极值选举控制的复杂性
International Symposium on Artificial Intelligence and Mathematics Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-672-9-277
Cynthia Maushagen, J. Rothe
{"title":"Complexity of Control by Partitioning Veto and Maximin Elections","authors":"Cynthia Maushagen, J. Rothe","doi":"10.3233/978-1-61499-672-9-277","DOIUrl":"https://doi.org/10.3233/978-1-61499-672-9-277","url":null,"abstract":"Control by partition refers to situations where an election chair seeks to influence the outcome of an election by partitioning either the candidates or the voters into two groups, thus creating two first-round subelections that determine who will take part in a final round. In particular, “gerrymandering” (maliciously resizing election districts) can be modeled by partition-of-voters control attacks. While the complexity of control by partition (and other control actions) has been studied thoroughly for many voting systems, such results about the important systems veto and maximin voting are sparse. We settle the complexity of control by partition for veto in a broad variety of models and for maximin with respect to destructive control by partition of candidates.","PeriodicalId":354113,"journal":{"name":"International Symposium on Artificial Intelligence and Mathematics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126375038","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}
引用次数: 15
下一页 尾页
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学术官方微信