Šimon Schierreich

Economics, Econometrics and Finance · Social Sciences

3h-index26citations38works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Game Theory and Voting Systems(19), Game Theory and Applications(13), Auction Theory and Applications(9), Advanced Graph Theory Research(8), Complex Network Analysis Techniques(7)

Publications38 total

Stability in Distance Preservation Games on Graphs
ArXiv.org·2026Open Access
Stability in Distance Preservation Games on Graphs
arXiv (Cornell University)·2026Open Access
Participatory Budgeting Project Strength via Candidate Control
arXiv (Cornell University)·2026Open Access
Participatory Budgeting Project Strength via Candidate Control
ArXiv.org·2026Open Access
Tight Asymptotic Bounds for Fair Division With Externalities
arXiv (Cornell University)·2026Open Access
Tight Asymptotic Bounds for Fair Division With Externalities
ArXiv.org·2026Open Access
Participatory Budgeting Project Strength via Candidate Control
2025
Participatory Budgeting Project Strength via Candidate Control
2025
Balanced and Fair Partitioning of Friends
Proceedings of the AAAI Conference on Artificial Intelligence·2025· 1 citedOpen Access
Balanced and Fair Partitioning of Friends
arXiv (Cornell University)·2025Open Access
Two-Stage Refugee Resettlement Models: Computational Aspects of the Second Stage
Proceedings of the AAAI/ACM Conference on AI Ethics and Society·2025Open Access
On the Complexity of Target Set Selection in Simple Geometric Networks
Discrete Mathematics & Theoretical Computer Science·2024Open Access
Adaptive Graph Unlearning
2024Open Access
NS4S: Neighborhood Search for Scheduling Problems Via Large Language Models
2024Open Access
Guiding Large Language Models in Modeling Optimization Problems via Question Partitioning
2024· 1 citedOpen Access
Individual Rationality in Topological Distance Games is Surprisingly Hard
arXiv (Cornell University)·2024Open Access
The Complexity of Fair Division of Indivisible Items with Externalities
Proceedings of the AAAI Conference on Artificial Intelligence·2024· 1 citedOpen Access
Elections in the Post-Quantum Era: Is the Complexity Shield Strong Enough?
arXiv (Cornell University)·2024Open Access
Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra
arXiv (Cornell University)·2024Open Access
The Parameterized Complexity of Maximum Betweenness Centrality
Lecture notes in computer science·2024
page 1 of 2Next →

Frequent Co-authors

Dušan Knop(20), Ondřej Suchý(9), Robert Ganian(6), Jan Pokorný(6), Argyrios Deligkas(6), Eduard Eiben(6), Thekla Hamm(5), Qi Guo(5), Václav Blažej(4), Piotr Faliszewski(3), Łukasz Janeczko(3), Michal Dvořák(3), Shuyao Cheng(3), Pengwei Jin(3), Mateusz Słuszniak(3), Krzysztof Sornat(3), Viktoriia Korchemna(2), Sanjukta Roy(2), Stavros D. Ioannidis(2), Niclas Boehmer(2)