关于Stackelberg子集和博弈

Q2 Mathematics Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI:10.1016/j.endm.2018.07.018

Ulrich Pferschy , Gaia Nicosia , Andrea Pacifici

{"title":"关于Stackelberg子集和博弈","authors":"Ulrich Pferschy , Gaia Nicosia , Andrea Pacifici","doi":"10.1016/j.endm.2018.07.018","DOIUrl":null,"url":null,"abstract":"<div>This work addresses a two-level discrete decision problem, a so-called Stackelberg strategic game in a Subset Sum setting. One of the players, the leader <math><mi>L</mi></math>, may alter the weights of some items, and a second player, the follower <math><mi>F</mi></math>, selects a solution in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff which only depends on those items of its subset L that were included in the overall solution A, chosen by the follower. Complexity results and solution algorithms are presented for different variants of the leader problem.</div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.018","citationCount":"3","resultStr":"{\"title\":\"On a Stackelberg Subset Sum Game\",\"authors\":\"Ulrich Pferschy , Gaia Nicosia , Andrea Pacifici\",\"doi\":\"10.1016/j.endm.2018.07.018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>This work addresses a two-level discrete decision problem, a so-called Stackelberg strategic game in a Subset Sum setting. One of the players, the leader <math><mi>L</mi></math>, may alter the weights of some items, and a second player, the follower <math><mi>F</mi></math>, selects a solution in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff which only depends on those items of its subset L that were included in the overall solution A, chosen by the follower. Complexity results and solution algorithms are presented for different variants of the leader problem.</div>\",\"PeriodicalId\":35408,\"journal\":{\"name\":\"Electronic Notes in Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.018\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Notes in Discrete Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1571065318301628\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Discrete Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571065318301628","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 3

摘要

这项工作解决了一个两级离散决策问题，即所谓的子集和设置中的Stackelberg策略博弈。其中一个参与者，领导者L，可能会改变一些物品的权重，第二个参与者，追随者F，选择一个解决方案，以便以最好的方式利用有限的资源。最后，领导者获得的收益仅取决于其子集L中包含在整体解决方案a中的项目，这些项目由追随者选择。给出了不同类型领导问题的复杂度结果和求解算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On a Stackelberg Subset Sum Game

This work addresses a two-level discrete decision problem, a so-called Stackelberg strategic game in a Subset Sum setting. One of the players, the leader $L$ , may alter the weights of some items, and a second player, the follower $F$ , selects a solution in order to utilize a bounded resource in the best possible way. Finally, the leader receives a payoff which only depends on those items of its subset L that were included in the overall solution A, chosen by the follower. Complexity results and solution algorithms are presented for different variants of the leader problem.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Minimal condition for shortest vectors in lattices of low dimension Enumerating words with forbidden factors Polygon-circle and word-representable graphs On an arithmetic triangle of numbers arising from inverses of analytic functions