| On the complexity of bribery with distance restrictions | |
| Yang Y.; Shrestha Y.R.; Guo J. | |
| 刊名 | Theoretical Computer Science
 |
| 2018 | |
| 关键词 | Bribery Complexity Distance restriction Swap distance Voting |
| DOI | 10.1016/j.tcs.2018.08.013 |
| URL标识 | 查看原文 |
| 公开日期 | [db:dc_date_available] |
| 内容类型 | 期刊论文 |
| URI标识 | http://www.corc.org.cn/handle/1471x/4576081 |
| 专题 | 山东大学 |
| 作者单位 | 1.Chair of Economic Theory, Universität des Saarlandes, Saarbrücken, Germany 2.Department of Management, Technology and Economi |
| 推荐引用方式 GB/T 7714 | Yang Y.,Shrestha Y.R.,Guo J.. On the complexity of bribery with distance restrictions[J]. Theoretical Computer Science,2018. |
| APA | Yang Y.,Shrestha Y.R.,&Guo J..(2018).On the complexity of bribery with distance restrictions.Theoretical Computer Science. |
| MLA | Yang Y.,et al."On the complexity of bribery with distance restrictions".Theoretical Computer Science (2018). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论