5 citations · 17 across the 24 of their papers we have counts for
4 papers · 1 filter
Recognizing when a preference system is close to admitting a master list
Ildikó Schlotter
A preference system is an undirected graph where vertices have preferences over their neighbors, and admits a master list if all preferences can be deri…
Odd Paths, Cycles and -joins: Connections and Algorithms
Ildikó Schlotter, András Sebő
Minimizing the weight of an edge set satisfying parity constraints is a challenging branch of combinatorial optimization as witnessed by the binary hypergraph chapter of Alexander…
Complexity of Stability in Trading Networks
Tamás Fleiner, Zsuzsanna Jankó, Ildikó Schlotter +1
Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concep…
Multivariate Analyis of Swap Bribery
Britta Dorn, Ildikó Schlotter
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa…