QQ客服 官方微博 反馈留言

	On the complexity of bribery with distance restrictions
	Yang, Yongjie; Shrestha, Yash Raj; Guo, Jiong
刊名	THEORETICAL COMPUTER SCIENCE
	2019
卷号	760页码:55-71
关键词	Voting Bribery Complexity Distance restriction Swap distance
DOI	10.1016/j.tcs.2018.08.013
URL标识	查看原文
公开日期	[db:dc_date_available]
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4542641
专题	山东大学
作者单位	1.Univ Saarland, Chair Econ Theory, Saarbrucken, Germany. 2.Swiss Fed Inst Technol, Dept Management Technol & Econ
推荐引用方式 GB/T 7714	Yang, Yongjie,Shrestha, Yash Raj,Guo, Jiong. On the complexity of bribery with distance restrictions[J]. THEORETICAL COMPUTER SCIENCE,2019,760:55-71.
APA	Yang, Yongjie,Shrestha, Yash Raj,&Guo, Jiong.(2019).On the complexity of bribery with distance restrictions.THEORETICAL COMPUTER SCIENCE,760,55-71.
MLA	Yang, Yongjie,et al."On the complexity of bribery with distance restrictions".THEORETICAL COMPUTER SCIENCE 760(2019):55-71.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。