Computational complexity in the design of voting rules


Hokkaido University \| Library \| HUSCAP	Advanced Search		言語

	Home
	About HUSCAP
	Open Access Policy

	Browse by Author

Browse
	Communities & Collections

	Scholarly Journals
	Theses
	Doctoral Dissertations Listed by Graduate Schools
	Conference Procs.
	Events

	HUSCAP Senior (in Japanese)

	Societies

	Downloads (country)

For university staff
	How to post your papers to HUSCAP
	Publication of theses
	Helpline about theses publication

Open Archives Compliant

You can search our collection also at:
	Google
	Google Scholar
	CiNii
	IRDB
	OAIster
	NDLTD

Files in This Item:

paper.pdf

79.2 kB

PDF

Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/63933

Title:	Computational complexity in the design of voting rules
Authors:	Takamiya, Koji Browse this author
Authors:	Tanaka, Akira Browse this author →KAKEN DB
Keywords:	Computational complexity
	NP-completeness
	Simple game
	Core
	Stability
	Nakamura number
Issue Date:	Jan-2016
Publisher:	Springer
Journal Title:	Theory and decision
Volume:	80
Issue:	1
Start Page:	33
End Page:	41
Publisher DOI:	10.1007/s11238-014-9422-7
Abstract:	This paper considers the computational complexity of the design of voting rules, which is formulated by simple games. We prove that it is an NP-complete problem to decide whether a given simple game is stable, or not.
Rights:	The final publication is available at www.springerlink.com
Type:	article (author version)
URI:	http://hdl.handle.net/2115/63933
Appears in Collections:	情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 田中章

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University