arXiv Open Access 2018

Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time

Kanstantsin Pashkovich

Lihat Sumber

Abstrak

We provide an algorithm for computing the nucleolus for an instance of a weighted voting game in pseudo-polynomial time. This resolves an open question posed by Elkind. et.al. 2007.

Topik & Kata Kunci

cs.GT math.OC

Penulis (1)

Kanstantsin Pashkovich

Format Sitasi

APA MLA BibTeX

Pashkovich, K. (2018). Computing the Nucleolus of Weighted Voting Games in Pseudo-polynomial Time. https://arxiv.org/abs/1810.02670

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓