By Professor Haris Aziz

Preprints

Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, Equilibria Under the Probabilistic Serial Rule, http://dx.doi.org/10.48550/arxiv.1502.04888

Aziz H; Gaspers S; Mackenzie S; Mattei N; Narodytska N; Walsh T, 2015, Manipulating the Probabilistic Serial Rule, http://dx.doi.org/10.48550/arxiv.1501.06626

Aziz H; Walsh T, 2015, Algorithms for two variants of Satisfaction Approval Voting

Aziz H; Cahan C; Gretton C; Kilby P; Mattei N; Walsh T, 2014, A Study of Proxies for Shapley Allocations of Transport Costs, http://dx.doi.org/10.48550/arxiv.1408.4901

Aziz H; Brill M; Conitzer V; Elkind E; Freeman R; Walsh T, 2014, Justified Representation in Approval-Based Committee Voting, http://dx.doi.org/10.48550/arxiv.1407.8269

Aziz H; Gaspers S; Gudmundsson J; Mackenzie S; Mattei N; Walsh T, 2014, Computational Aspects of Multi-Winner Approval Voting, http://dx.doi.org/10.48550/arxiv.1407.3247

Aziz H, 2014, Testing Top Monotonicity, http://arxiv.org/abs/1403.7625v5

Aziz H, 2014, Random assignment with multi-unit demands, http://arxiv.org/abs/1401.7700v3

Aziz H; Gaspers S; Mattei N; Narodytska N; Walsh T, 2014, Strategic aspects of the probabilistic serial rule for the allocation of goods, http://dx.doi.org/10.48550/arxiv.1401.6523

Aziz H; Bachrach Y; Elkind E; Paterson M, 2014, False-Name Manipulations in Weighted Voting Games, http://dx.doi.org/10.48550/arxiv.1401.3869

Aziz H; Gaspers S; Mackenzie S; Walsh T, 2013, Fair assignment of indivisible objects under ordinal preferences, http://dx.doi.org/10.48550/arxiv.1312.6546

Aziz H; Brandt F; Brill M, 2013, The Computational Complexity of Random Serial Dictatorship, http://dx.doi.org/10.48550/arxiv.1304.3169

Aziz H; Brill M; Harrenstein P, 2012, Testing Substitutability of Weak Preferences, http://dx.doi.org/10.48550/arxiv.1201.0432

Aziz H; Harrenstein P; Pyrga E, 2011, Individual-based stability in hedonic games depending on the best or worst players, http://arxiv.org/abs/1105.1824v2

Aziz H; Sørensen TB, 2011, Path coalitional games, http://arxiv.org/abs/1103.3310v2

Aziz H; Brandt F; Seedig HG, 2010, Stable partitions in additively separable hedonic games, http://dx.doi.org/10.48550/arxiv.1008.0074

Aziz H; Brandt F; Seedig HG, 2010, Optimal Partitions in Additively Separable Hedonic Games, http://dx.doi.org/10.48550/arxiv.1005.4540

Aziz H; Lachish O; Paterson M; Savani R, 2009, Wiretapping a hidden network, http://dx.doi.org/10.48550/arxiv.0909.5293

Aziz H; Lachish O; Paterson M; Savani R, 2009, Spanning connectivity games, http://arxiv.org/abs/0906.3643v1

Aziz H; Paterson M, 2008, Computing voting power in easy weighted voting games, http://arxiv.org/abs/0811.2497v2

Aziz H, 2008, Complexity of comparison of influence of players in simple games, http://arxiv.org/abs/0809.0519v1

Back to profile page