Piotr Faliszewski

Navedeno

	Vse	Od leta 2020
Navedbe	7028	3083
indeks h	47	30
indeks i10	103	85

640

320

160

480

20082009201020112012201320142015201620172018201920202021202220232024202558 85 163 206 329 223 280 376 561 520 438 527 558 590 626 617 629 57

Javni dostop

Prikaži vse

59 člankov

0 člankov

na voljo

ni na voljo

Na podlagi zahtev v povezavi s financiranjem

Soavtorji

Piotr SkowronUniversity of WarsawPreverjeni e-poštni naslov na mimuw.edu.pl
Nimrod TalmonBen-Gurion UniversityPreverjeni e-poštni naslov na bgu.ac.il
Arkadii SlinkoDepartment of Mathematics and Centre for Mathematics in Social Sciences, The University of AucklandPreverjeni e-poštni naslov na auckland.ac.nz
Edith ElkindNorthwestern UniversityPreverjeni e-poštni naslov na northwestern.edu
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 SzufaCNRS, LAMSADE, Paris-DauphinePreverjeni e-poštni naslov na dauphine.psl.eu
Andrzej KaczmarczykPostdoc, University of Chicago, USAPreverjeni e-poštni naslov na uchicago.edu
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
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
Yoram BachrachMeta (FAIR)Preverjeni e-poštni naslov na meta.com
Krzysztof SornatAGH University, PolandPreverjeni e-poštni naslov na agh.edu.pl
Ayumi IgarashiThe University of TokyoPreverjeni e-poštni naslov na mist.i.u-tokyo.ac.jp
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	343*	2009
Properties of multiwinner voting rules E Elkind, P Faliszewski, P Skowron, A Slinko Social Choice and Welfare 48, 599-632, 2017	325	2017
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	318*	2009
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	315	2017
AI’s war on manipulation: Are we winning P Faliszewski, AD Procaccia AI Magazine 31 (4), 53-64, 2010	233	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	227	2016
Using complexity to protect elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Communications of the ACM 53 (11), 74-82, 2010	219	2010
Control and Bribery in Voting. P Faliszewski, J Rothe Handbook of computational social choice, 146-168, 2016	218	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	180	2011
Achieving fully proportional representation: Approximability results P Skowron, P Faliszewski, A Slinko Artificial Intelligence 222, 67-103, 2015	160*	2015
Swap bribery E Elkind, P Faliszewski, A Slinko Algorithmic Game Theory, 299-310, 2009	159	2009
Multimode control attacks on elections P Faliszewski, E Hemaspaandra, LA Hemaspaandra Journal of Artificial Intelligence Research 40 (1), 305-351, 2011	153	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	137	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	121	2011
Campaigns for lazy voters: truncated ballots. D Baumeister, P Faliszewski, J Lang, J Rothe AAMAS, 577-584, 2012	119	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	105	2015
A framework for approval-based budgeting methods N Talmon, P Faliszewski Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2181-2188, 2019	99	2019
Manipulating the quota in weighted voting games M Zuckerman, P Faliszewski, Y Bachrach, E Elkind Artificial Intelligence 180, 1-19, 2012	97	2012
Committee scoring rules: Axiomatic characterization and hierarchy P Faliszewski, P Skowron, A Slinko, N Talmon ACM Transactions on Economics and Computation (TEAC) 7 (1), 1-39, 2019	95*	2019

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