Search Results for author:
Found 5 papers, 2 papers with code
Expected Frequency Matrices of Elections: Computation, Geometry, and Preference Learning
We use the ``map of elections'' approach of Szufa et al. (AAMAS-2020) to analyze several well-known vote distributions.
A Multivariate Complexity Analysis of the Material Consumption Scheduling Problem
The NP-hard MATERIAL CONSUMPTION SCHEDULING Problem and closely related problems have been thoroughly studied since the 1980's.
Computer Science and Game Theory F.2.2; G.2.1; I.2.8; I.1.2
Bribery and Control in Stable Marriage
We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals.
Computer Science and Game Theory Discrete Mathematics
Complexity of Shift Bribery in Committee Elections
Given an election, a preferred candidate p, and a budget, the SHIFT BRIBERY problem asks whether p can win the election after shifting p higher in some voters' preference orders.
