A postdoc hosted by Dušan Knop at the Department of Theoretical Computer Science, Faculty of Information Technology, at the Czech Technical University in Prague.

Research interests

Computational social choice • Decision making • Social choice simulations • Parameterized complexity • Multiwinner and single-winner elections • Multiwinner and single-winner voting • Fair allocation • Fair division

News

• [Dec 25] Our paper Project Submission Games in Participatory Budgeting (P. Faliszewski, Ł. Janeczko, A. Kaczmarczyk, G. Lisowski, and G. Pierczyński) accepted at AAMAS-26 as a full paper.
• [Nov 25] Our paper Putting Fair Division on the Map (P. Böhm, R. Bredereck, P. Gölz, A. Kaczmarczyk, and S. Szufa) accepted at AAAI-26 as a poster.
• [Oct 25] Attending PRAGMAFest! in Kraków to present our paper Efficient Algorithms for Electing Successive Committees (P. Jain, A. Kaczmarczyk) . See the full version!
• [Oct 25] Attending GameSec-25 in Athens to present our paper On Sequential Fault-Intolerant Process Planning (A. Kaczmarczyk, D. Choo, N. Boehmer, M. Tambe, H. Xu ). See the arXiv version!
• [Sep 25] Our paper Strategic Cost Selection in Participatory Budgeting (P. Faliszewski, Ł. Janeczko, A. Kaczmarczyk, G. Lisowski, P. Skowron, S. Szufa, and M. Szwagierczak) accepted at NeurIPS-25 as a poster.
• [Sep 25] Our papers Learning Real-Life Approval Elections (P. Faliszewski, Ł. Janeczko, A. Kaczmarczyk, M. Kurdziel, G. Pierczyński, and S. Szufa) , Guide to Numerical Experiments on Elections in Computational Social Choice (N. Boehmer, P. Faliszewski, Ł. Janeczko, A. Kaczmarczyk, G. Lisowski, G. Pierczyński, S. Rey, D. Stolicki, S. Szufa, and T. Wąs) , and Computing Efficient Envy-Free Partial Allocations of Indivisible Goods (R. Bredereck, A. Kaczmarczyk, J. Luo, and B. Sun) to be presented at COMSOC-2025, the 10th International Workshop on Computational Social Choice.
• [Aug 25] Our paper How to tamper with a Parliament: Strategic campaigns in apportionment elections (R. Bredereck, P. Faliszewski, M. Furdyna, A. Kaczmarczyk, J. Kaczmarek, M. Lackner, C. Laußmann, J. Rothe, and T. Seeger) published online in the Journal of Computer and System Sciences.
• [Aug 25] Attending IJCAI-25 in Montréal to present our paper Efficient Algorithms for Electing Successive Committees (P. Jain, A. Kaczmarczyk) .
• [Aug 25] Joining as a panelist in a joint discussion on how social choice interacts with the current GenAI-focused environment, at workshops SCaLA-25 and CFD-25 at IJCAI-25 in Montréal.
• [Jul 25] Our paper On Sequential Fault-Intolerant Process Planning (A. Kaczmarczyk, D. Choo, N. Boehmer, M. Tambe, H. Xu ) accepted for publication at GameSec-25.
• [Jun 25] Our paper Learning Real-Life Approval Elections (P. Faliszewski, Ł. Janeczko, A. Kaczmarczyk, M. Kurdziel, G. Pierczyński, and S. Szufa) accepted for presentation at the workshop SCALA-25 at IJCAI-25.
• [Mar 25] Our paper Efficient Algorithms for Electing Successive Committees (P. Jain, A. Kaczmarczyk) accepted for publication at IJCAI-25.

See my CV and the Short Bio section for if you would like to learn more about my career record.