Piotr Faliszewski

Navedeno

	Vse	Od leta 2018
Navedbe	6322	3350
indeks h	45	33
indeks i10	92	78

640

320

160

480

200820092010201120122013201420152016201720182019202020212022202359 86 165 202 331 224 276 384 555 525 443 531 546 601 632 592

Javni dostop

Prikaži vse

54 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Arkadii SlinkoDepartment of Mathematics and Centre for Mathematics in Social Sciences, The University of AucklandPreverjeni e-poštni naslov na auckland.ac.nz
Piotr SkowronUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Nimrod TalmonBen-Gurion UniversityPreverjeni e-poštni naslov na bgu.ac.il
Edith ElkindUniversity of OxfordPreverjeni e-poštni naslov na cs.ox.ac.uk
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterPreverjeni e-poštni naslov na cs.rochester.edu
Robert BredereckTU ClausthalPreverjeni e-poštni naslov na tu-clausthal.de
Jörg RotheProfessor of Computer Science, Heinrich-Heine-Universität DüsseldorfPreverjeni e-poštni naslov na cs.uni-duesseldorf.de
Stanisław SzufaJagiellonian Center for Quantitative Research in Political Science, Jagiellonian UniversityPreverjeni e-poštni naslov na uj.edu.pl
Andrzej KaczmarczykAGH University, PolandPreverjeni e-poštni naslov na agh.edu.pl
Martin LacknerTU WienPreverjeni e-poštni naslov na dbai.tuwien.ac.at
Edith HemaspaandraProfessor of Computer Science, RITPreverjeni e-poštni naslov na cs.rit.edu
Jiehua ChenTU ViennaPreverjeni e-poštni naslov na tuwien.ac.at
Yoram BachrachDeepMindPreverjeni e-poštni naslov na google.com
Henning SchnoorResearcher of Computer Science, Dept. of Computer Science, Kiel UniversityPreverjeni e-poštni naslov na ti.informatik.uni-kiel.de
Jerome Langsenior researcher at CNRSPreverjeni e-poštni naslov na lamsade.dauphine.fr
Ayumi IgarashiNational Institute of InformaticsPreverjeni e-poštni naslov na nii.ac.jp
Krzysztof Sornatpostdoc at IDSIA, SwitzerlandPreverjeni e-poštni naslov na idsia.ch
Dorothea BaumeisterJuniorprofessor of Computer Science, Heinrich-Heine Universitaet DuesseldorfPreverjeni e-poštni naslov na hhu.de
Pasin ManurangsiGoogle ResearchPreverjeni e-poštni naslov na google.com
Svetlana ObraztsovaNanyang Technological UniversityPreverjeni e-poštni naslov na ntu.edu.sg

Spremljaj

Piotr Faliszewski

AGH University of Science and Technology

Preverjeni e-poštni naslov na agh.edu.pl - Domača stran

Theoretical Computer Science Artificial Intelligence Computational Social Choice Social Choice Cooperative Game Theory


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
How hard is bribery in elections P Faliszewski, E Hemaspaandra, L Hemaspaandra Journal of Artificial Intelligence Research 35 (1), 485-532, 2009	330*	2009
Llull and Copeland voting computationally resist bribery and constructive control P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe Journal of Artificial Intelligence Research 35 (1), 275-341, 2009	308*	2009
Properties of multiwinner voting rules E Elkind, P Faliszewski, P Skowron, A Slinko Social Choice and Welfare 48, 599-632, 2017	279	2017
Multiwinner voting: A new challenge for social choice theory P Faliszewski, P Skowron, A Slinko, N Talmon Trends in computational social choice 74 (2017), 27-47, 2017	272	2017
AI’s war on manipulation: Are we winning P Faliszewski, AD Procaccia AI Magazine 31 (4), 53-64, 2010	225	2010
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	210	2010
Finding a collective set of items: From proportional multirepresentation to group recommendation P Skowron, P Faliszewski, J Lang Artificial Intelligence 241, 191-216, 2016	201	2016
Control and Bribery in Voting. P Faliszewski, J Rothe Handbook of computational social choice, 146-168, 2016	197	2016
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control P Faliszewski, E Hemaspaandra, LA Hemaspaandra, J Rothe Information and Computation 209 (2), 89-107, 2011	173	2011
Achieving fully proportional representation: Approximability results P Skowron, P Faliszewski, A Slinko Artificial Intelligence 222, 67-103, 2015	154*	2015
Swap bribery E Elkind, P Faliszewski, A Slinko Algorithmic Game Theory, 299-310, 2009	151	2009
Multimode control attacks on elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of Artificial Intelligence Research 40 (1), 305-351, 2011	147	2011
A richer understanding of the complexity of election systems P Faliszewski, E Hemaspaandra, L Hemaspaandra, J Rothe Fundamental Problems in Computing: Essays in Honor of Professor Daniel J …, 2009	134	2009
Copeland voting: Ties matter P Faliszewski, E Hemaspaandra, H Schnoor Proceedings of the 7th international joint conference on Autonomous agents …, 2008	128	2008
The complexity of manipulative attacks in nearly single-peaked electorates P Faliszewski, E Hemaspaandra, LA Hemaspaandra Arxiv preprint arXiv:1105.5032, 2011	116	2011
Campaigns for lazy voters: truncated ballots. D Baumeister, P Faliszewski, J Lang, J Rothe AAMAS, 577-584, 2012	111	2012
The complexity of fully proportional representation for single-crossing electorates P Skowron, L Yu, P Faliszewski, E Elkind Theoretical Computer Science 569, 43-57, 2015	101	2015
Clone Structures in Voters' Preferences E Elkind, P Faliszewski, A Slinko Arxiv preprint arXiv:1110.3939, 2011	89	2011
Manipulating the quota in weighted voting games M Zuckerman, P Faliszewski, Y Bachrach, E Elkind Artificial Intelligence 180, 1-19, 2012	88*	2012
Cloning in elections: Finding the possible winners E Elkind, P Faliszewski, A Slinko Journal of Artificial Intelligence Research 42 (1), 529-573, 2011	88*	2011

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–20

Št. navedb na leto

Podvojene navedbe

Združene navedbe

Dodajanje soavtorjevSoavtorji

Spremljaj

Navedeno

Soavtorji