By Professor Haris Aziz

Preprints

Aziz H; Huang S, 2017, A Polynomial-time Algorithm to Achieve Extended Justified Representation, http://arxiv.org/abs/1703.10415v1

Aziz H; Elkind E; Faliszewski P; Lackner M; Skowron P, 2017, The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality, http://arxiv.org/abs/1701.08023v1

Aziz H; Haan RD; Rastegari B, 2016, Pareto Optimal Allocation under Uncertain Preferences, http://arxiv.org/abs/1609.02795v2

Aziz H; Biró P; Gaspers S; Haan RD; Mattei N; Rastegari B, 2016, Stable Matching with Uncertain Linear Preferences, http://arxiv.org/abs/1607.02917v1

Aziz H; Luo P; Rizkallah C, 2016, Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences, http://arxiv.org/abs/1604.07540v1

Aziz H; Mackenzie S, 2016, A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents, http://arxiv.org/abs/1604.03655v12

Aziz H; Lev O; Mattei N; Rosenschein JS; Walsh T, 2016, Strategyproof Peer Selection using Randomization, Partitioning, and Apportionment, http://arxiv.org/abs/1604.03632v4

Aziz H; Rauchecker G; Schryen G; Walsh T, 2016, Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods, http://arxiv.org/abs/1604.01435v1

Aziz H; Biro P; Lang J; Lesca J; Monnot J, 2016, Efficient Reallocation under Additive and Responsive Preferences, http://dx.doi.org/10.48550/arxiv.1604.01091

Aziz H, 2016, A Comment on the Averseness of Random Serial Dictatorship to Stochastic Dominance Efficiency, http://arxiv.org/abs/1603.07392v2

Aziz H, 2016, Mechanisms for House Allocation with Existing Tenants under Dichotomous Preferences, http://arxiv.org/abs/1603.03073v2

Aziz H; Bouveret S; Lang J; Mackenzie S, 2016, Complexity of Manipulating Sequential Allocation, http://arxiv.org/abs/1602.06940v1

Abeliuk A; Aziz H; Berbeglia G; Gaspers S; Kalina P; Mattei N; Peters D; Stursberg P; Hentenryck PV; Walsh T, 2016, Interdependent Scheduling Games.

Aziz H; Harrenstein P; Lang J; Wooldridge M, 2015, Boolean Hedonic Games, http://dx.doi.org/10.48550/arxiv.1509.07062

Aziz H; Chen J; Filos-Ratsikas A; Mackenzie S; Mattei N, 2015, Egalitarianism of Random Assignment Mechanisms, http://arxiv.org/abs/1507.06827v1

Aziz H; Brânzei S; Filos-Ratsikas A; Frederiksen SKS, 2015, The Adjusted Winner Procedure: Characterizations and Equilibria, http://dx.doi.org/10.48550/arxiv.1503.06665

Aleksandrov M; Aziz H; Gaspers S; Walsh T, 2015, Online Fair Division: analysing a Food Bank problem, http://arxiv.org/abs/1502.07571v2

Aziz H; Seedig HG; von Wedel JK, 2015, On the Susceptibility of the Deferred Acceptance Algorithm, http://dx.doi.org/10.48550/arxiv.1502.06318

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

Aziz H, 2015, Competitive Equilibrium with Equal Incomes for Allocation of Indivisible Objects, http://arxiv.org/abs/1501.06627v2

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

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://arxiv.org/abs/1408.4901v1

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://arxiv.org/abs/1407.3247v1

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; Ye C, 2013, Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations, http://arxiv.org/abs/1307.2908v3

Aziz H; Keijzer BD, 2013, Shapley Meets Shapley, http://arxiv.org/abs/1307.0332v1

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, 2012, Stable marriage and roommate problems with individual-based stability, http://arxiv.org/abs/1204.1628v2

Aziz H; Brandl F, 2012, Existence of Stability in Hedonic Coalition Formation Games, http://arxiv.org/abs/1201.4754v1

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; Keijzer BD, 2011, Complexity of coalition structure generation, http://arxiv.org/abs/1101.1007v6

Aziz H; Brandt F; Seedig HG, 2010, Stable partitions in additively separable hedonic games, http://dx.doi.org/10.1016/j.artint.2012.09.006

Aziz H; Brandt F; Seedig HG, 2010, Optimal Partitions in Additively Separable Hedonic Games, http://dx.doi.org/10.1016/j.artint.2012.09.006

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

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

Aziz H; Paterson M, 2009, False name manipulations in weighted voting games: splitting, merging and annexation, http://arxiv.org/abs/0905.3348v1

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