Andrzej Kaczmarczyk

Get in touch
A postdoc fellow in The Strategic IntelliGence for Machine Agents (SIGMA) Lab, led by Haifeng Xu at the Department of Computer Science at the University of Chicago, United States.

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

Selected Working Papers

Putting Fair Division on the Map (preprint)
P. Böhm, R. Bredereck, P. Gölz, A. Kaczmarczyk, and S. Szufa

News

  • [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.
  • [Dec 24] Our paper Computing Efficient Envy-Free Partial Allocations of Indivisible Goods (R. Bredereck, A. Kaczmarczyk, J. Luo, B. Sun) accepted for publication at AAMAS-25.
  • [Dec 24] Our paper Learning Real-Life Approval Elections (P. Faliszewski, Ł. Janeczko, A. Kaczmarczyk, M. Kurdziel, G. Pierczyński, and S. Szufa) accepted for publication at AAMAS-25.
  • [Aug 24] Excited to start as a postdoc at The SIGMA Lab at UChicago. Grateful to Haifeng Xu, the lab's leader.

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

Get in touch

  • akaczmarczyk 〈at〉
         uchicago.edu
  • LinkedIn dblp
  • About Me
  • Publications
  • Academic Service
  • Teaching
  • Short Bio

© Andrzej Kaczmarczyk. All rights reserved. Design: HTML5 UP.

Toggle