Šimon Schierreich
YOU?
Author Swipe
View article: Balanced and Fair Partitioning of Friends
Balanced and Fair Partitioning of Friends Open
In the recently introduced model of fair partitioning of friends, there is a set of agents located on the vertices of an underlying graph that indicates the friendships between the agents. The task is to partition the graph into k balanced…
View article: Balanced and Fair Partitioning of Friends
Balanced and Fair Partitioning of Friends Open
In the recently introduced model of fair partitioning of friends, there is a set of agents located on the vertices of an underlying graph that indicates the friendships between the agents. The task is to partition the graph into $k$ balanc…
View article: Two-Stage Refugee Resettlement Models: Computational Aspects of the Second Stage
Two-Stage Refugee Resettlement Models: Computational Aspects of the Second Stage Open
I discuss recent progresses in the analysis of computational aspects of two-stage refugee resettlement methods. I pay special attention to the second stage of these models, as it is arguably understudied compared to the first stage. I also…
View article: On the Complexity of Target Set Selection in Simple Geometric Networks
On the Complexity of Target Set Selection in Simple Geometric Networks Open
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a hea…
View article: Guiding Large Language Models in Modeling Optimization Problems via Question Partitioning
Guiding Large Language Models in Modeling Optimization Problems via Question Partitioning Open
Optimization problems are ubiquitous across various domains, such as resource scheduling, production planning, and sales management. Traditionally, they are modeled manually, leading to inefficiencies due to difficulties in communication a…
View article: NS4S: Neighborhood Search for Scheduling Problems Via Large Language Models
NS4S: Neighborhood Search for Scheduling Problems Via Large Language Models Open
Large Language Models (LLMs) have emerged as a promising technology for solving combinatorial optimization problems. However, their direct application to scheduling problems remains limited due to the inherent complexity of these problems.…
View article: Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra Open
We study the Equitable Connected Partition (ECP for short) problem, where we are given a graph G=(V,E) together with an integer p, and our goal is to find a partition of V into p parts such that each part induces a connected sub-graph of G…
View article: Individual Rationality in Topological Distance Games is Surprisingly Hard
Individual Rationality in Topological Distance Games is Surprisingly Hard Open
In the recently introduced topological distance games, strategic agents need to be assigned to a subset of vertices of a topology. In the assignment, the utility of an agent depends on both the agent's inherent utilities for other agents a…
View article: The Complexity of Fair Division of Indivisible Items with Externalities
The Complexity of Fair Division of Indivisible Items with Externalities Open
We study the computational complexity of fairly allocating a set of indivisible items under externalities. In this recently-proposed setting, in addition to the utility the agent gets from their bundle, they also receive utility from items…
View article: Elections in the Post-Quantum Era: Is the Complexity Shield Strong Enough?
Elections in the Post-Quantum Era: Is the Complexity Shield Strong Enough? Open
The election, a cornerstone of democracy, is one of the best-recognizable symbols of democratic governance. Voters' confidence in elections is essential, and these days, we can watch practically in live broadcast what consequences distrust…
View article: Evaluation of Project Performance in Participatory Budgeting
Evaluation of Project Performance in Participatory Budgeting Open
We study ways of evaluating the performance of losing projects in participatory budgeting (PB) elections by seeking actions that would have led to their victory. We focus on lowering the projects' costs, obtaining additional approvals for …
View article: Maximizing Social Welfare in Score-Based Social Distance Games
Maximizing Social Welfare in Score-Based Social Distance Games Open
Social distance games have been extensively studied as a coalition formation model where the utilities of agents in each coalition were captured using a utility function $u$ that took into account distances in a given social network. In th…
View article: Towards More Realistic Models for Refugee Integration: Anonymous Refugee Housing with Upper-Bounds
Towards More Realistic Models for Refugee Integration: Anonymous Refugee Housing with Upper-Bounds Open
[Knop and Schierreich; AAMAS~'23] recently introduced a novel model for refugee housing, where we are given a city's topology represented as a graph, a set of inhabitants who occupy some vertices of the topology, and a set of refugees that…
View article: The Complexity of Fair Division of Indivisible Items with Externalities
The Complexity of Fair Division of Indivisible Items with Externalities Open
We study the computational complexity of fairly allocating a set of indivisible items under externalities. In this recently-proposed setting, in addition to the utility the agent gets from their bundle, they also receive utility from items…
View article: On the Complexity of Target Set Selection in Simple Geometric Networks
On the Complexity of Target Set Selection in Simple Geometric Networks Open
We study the following model of disease spread in a social network. At first, all individuals are either infected or healthy. Next, in discrete rounds, the disease spreads in the network from infected to healthy individuals such that a hea…
View article: Maximizing Social Welfare in Score-Based Social Distance Games
Maximizing Social Welfare in Score-Based Social Distance Games Open
Social distance games have been extensively studied as a coalition formation\nmodel where the utilities of agents in each coalition were captured using a\nutility function u that took into account distances in a given social network.\nIn t…
View article: The Parameterized Complexity of Network Microaggregation
The Parameterized Complexity of Network Microaggregation Open
Microaggregation is a classical statistical disclosure control technique which requires the input data to be partitioned into clusters while adhering to specified size constraints. We provide novel exact algorithms and lower bounds for the…
View article: Maximizing Influence Spread through a Dynamic Social Network (Student Abstract)
Maximizing Influence Spread through a Dynamic Social Network (Student Abstract) Open
Modern social networks are dynamic in their nature; a new connections are appearing and old connections are disappearing all the time. However, in our algorithmic and complexity studies, we usually model social networks as static graphs. I…
View article: Host Community Respecting Refugee Housing
Host Community Respecting Refugee Housing Open
We propose a novel model for refugee housing respecting the preferences of the accepting community and refugees themselves. In particular, we are given a topology representing the local community, a set of inhabitants occupying some vertic…
View article: On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations Open
For many problems, the important instances from practice possess certain structure that one should reflect in the design of specific algorithms. As data reduction is an important and inextricable part of today's computation, we employ one …
View article: Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Hedonic Diversity Games: A Complexity Picture with More than Two Colors Open
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as colo…
View article: Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract)
Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract) Open
Information diffusion in social networks is a well-studied concept in social choice theory. We propose the study of the diffusion of two secrets in a heterogeneous environment from the complexity perspective, that is, there are two differe…
View article: Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract)
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract) Open
We propose a new discrete model for simultaneously spreading two opinions within a social network inspired by the famous Target Set Selection problem. We are given a social network, a seed-set of agents for each opinion, and two thresholds…
View article: Hedonic Diversity Games: A Complexity Picture with More than Two Colors
Hedonic Diversity Games: A Complexity Picture with More than Two Colors Open
Hedonic diversity games are a variant of the classical Hedonic games designed to better model a variety of questions concerning diversity and fairness. Previous works mainly targeted the case with two diversity classes (represented as colo…
View article: Balancing the Spread of Two Opinions in Sparse Social Networks
Balancing the Spread of Two Opinions in Sparse Social Networks Open
Inspired by the famous Target Set Selection problem, we propose a new discrete model to simultaneously spread two opinions within a social network and perform an initial study of its complexity. Here, we are given a social network, a seed-…