8 citations · 13 across the 5 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 4 cited
Approximation and Parameterized Complexity of Minimax Approval Voting
Marek Cygan, Łukasz Kowalik, Arkadiusz Socała +1
We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance from the solution to the vo…
cs.GT2016
Inequity Aversion Pricing over Social Networks: Approximation Algorithms and Hardness Results
Georgios Amanatidis, Peter Fulla, Evangelos Markakis +1
We study a revenue maximization problem in the context of social networks. Namely, we consider a model introduced by Alon, Mansour, and Tennenholtz (EC 2013) that captures inequity…