Haris Aziz

Orcid: 0000-0001-9757-4956

Affiliations:
  • NICTA, Sydney
  • University of New South Wales, School of Computer Science and Engineering, Australia
  • TU Munich, Department of Informatics, Germany
  • University of Warwick, Department of Computer Science, UK


According to our database1, Haris Aziz authored at least 205 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Approximate and strategyproof maximin share allocation of chores with ordinal preferences.
Math. Program., January, 2024

Cutoff stability under distributional constraints with an application to summer internship matching.
Math. Program., January, 2024

Fair Lotteries for Participatory Budgeting.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Envy-Free House Allocation under Uncertain Preferences.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Fair division of indivisible goods: Recent progress and open questions.
Artif. Intell., September, 2023

Computing welfare-Maximizing fair allocations of indivisible goods.
Eur. J. Oper. Res., June, 2023

Nash Welfare and Facility Location.
CoRR, 2023

Proportionally Representative Clustering.
CoRR, 2023

Best-of-Both-Worlds Fairness in Committee Voting.
CoRR, 2023

Portioning using ordinal preferences: Fairness and efficiency.
Artif. Intell., 2023

Coordinating Monetary Contributions in Participatory Budgeting.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Computational Complexity of k-Stable Matchings.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Group Fairness in Peer Review.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Auction-Based Allocation of Location-Specific Tasks.
Proceedings of the AI 2023: Advances in Artificial Intelligence, 2023

Possible Fairness for Allocating Indivisible Resources.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Fair Allocation of Two Types of Chores.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Proportional Fairness in Obnoxious Facility Location.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Best of Both Worlds Fairness under Entitlements.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Matching Algorithms under Diversity-Based Reservations.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Probabilistic Rationing with Categorized Priorities: Processing Reserves Fairly and Efficiently.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Approval-Based Voting with Mixed Goods.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fairness Concepts for Indivisible Items with Externalities.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Algorithmic fair allocation of indivisible items: a survey and new questions.
SIGecom Exch., July, 2022

Stable matching with uncertain pairwise preferences.
Theor. Comput. Sci., 2022

A characterization of proportionally representative committees.
Games Econ. Behav., 2022

The vigilant eating rule: A general approach for probabilistic economic design with constraints.
Games Econ. Behav., 2022

Fair Division of Indivisible Goods: A Survey.
CoRR, 2022

Task Allocation using a Team of Robots.
CoRR, 2022

How to make the toss fair in cricket?
CoRR, 2022

Fair allocation of indivisible goods and chores.
Auton. Agents Multi Agent Syst., 2022

Strategyproof and Proportionally Fair Facility Location.
Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Random Rank: The One and Only Strategyproof and Proportionally Fair Randomized Facility Location Mechanism.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Matching Market Design with Constraints.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Two-sided matching with diversity concerns: an annotated reading list.
SIGecom Exch., 2021

Matching Under Preferences: Theory and Practice (Dagstuhl Seminar 21301).
Dagstuhl Reports, 2021

Individually Rational Land and Neighbor Allocation: Impossibility Results.
CoRR, 2021

Efficient, Fair, and Incentive-Compatible Healthcare Rationing.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Multi-Rank Smart Reserves.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

School Choice with Flexible Diversity Goals and Specialized Seats.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Committee Selection using Attribute Approvals.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Multi-Robot Task Allocation-Complexity and Approximation.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Obvious Manipulability of Voting Rules.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

Participatory Funding Coordination: Model, Axioms and Rules.
Proceedings of the Algorithmic Decision Theory - 7th International Conference, 2021

Proportionally Representative Participatory Budgeting with Ordinal Preferences.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Optimal Kidney Exchange with Immunosuppressants.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Achieving Envy-freeness and Equitability with Monetary Transfers.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Fair Mixing: The Case of Dichotomous Preferences.
ACM Trans. Economics and Comput., 2020

The expanding approvals rule: improving proportional representation and monotonicity.
Soc. Choice Welf., 2020

A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation.
Oper. Res. Lett., 2020

Fair Allocation with Diminishing Differences.
J. Artif. Intell. Res., 2020

The capacity constrained facility location problem.
Games Econ. Behav., 2020

Computing Fair Utilitarian Allocations of Indivisible Goods.
CoRR, 2020

The Hylland-Zeckhauser Rule Under Bi-Valued Utilities.
CoRR, 2020

Participatory Budgeting: Models and Approaches.
CoRR, 2020

A Probabilistic Approach to Voting, Allocation, Matching, and Coalition Formation.
CoRR, 2020

A bounded and envy-free cake cutting algorithm.
Commun. ACM, 2020

Stable Matching with Uncertain Linear Preferences.
Algorithmica, 2020

Computing and testing Pareto optimal committees.
Auton. Agents Multi Agent Syst., 2020

Strategyproof multi-item exchange under single-minded dichotomous preferences.
Auton. Agents Multi Agent Syst., 2020

Simultaneously Achieving Ex-ante and Ex-post Fairness.
Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Almost Group Envy-free Allocation of Indivisible Goods and Chores.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Mechanism Design for School Choice with Soft Diversity Constraints.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

The Temporary Exchange Problem.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Summer Internship Matching with Funding Constraints.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Developments in Multi-Agent Fair Allocation.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Computational Social Choice: The First Ten Years and Beyond.
Proceedings of the Computing and Software Science - State of the Art and Perspectives, 2019

Fractional Hedonic Games.
ACM Trans. Economics and Comput., 2019

Efficient reallocation under additive and responsive preferences.
Theor. Comput. Sci., 2019

Justifications of welfare guarantees under normalized utilities.
SIGecom Exch., 2019

Random matching under priorities: stability and no envy concepts.
Soc. Choice Welf., 2019

Algorithms for Pareto optimal exchange with bounded exchange cycles.
Oper. Res. Lett., 2019

The Constrained Round Robin Algorithm for Fair and Efficient Allocation.
CoRR, 2019

Strategyproof peer selection using randomization, partitioning, and apportionment.
Artif. Intell., 2019

Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity.
Artif. Intell., 2019

Fair Online Allocation of Perishable Goods and its Application to Electric Vehicle Charging.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Weighted Maxmin Fair Share Allocation of Indivisible Chores.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Strategyproof and Approximately Maxmin Fair Share Allocation of Chores.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

From Matching with Diversity Constraints to Matching with Regional Quotas.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Maxmin Share Fair Allocation of Indivisible Chores to Asymmetric Agents.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Pareto Optimal Allocation under Compact Uncertain Preferences.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
An impossibility result for housing markets with fractional endowments.
Oper. Res. Lett., 2018

On the tradeoff between efficiency and strategyproofness.
Games Econ. Behav., 2018

Fair allocation of combinations of indivisible goods and chores.
CoRR, 2018

Mechanism Design without Money for Common Goods.
CoRR, 2018

A Rule for Committee Selection with Soft Diversity Constraints.
CoRR, 2018

Computing and Testing Pareto Optimal Committees.
CoRR, 2018

Proportional Representation in Approval-based Committee Voting and Beyond.
CoRR, 2018

Fixing balanced knockout and double elimination tournaments.
Artif. Intell., 2018

Egalitarian Committee Scoring Rules.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Proportionally Representative Participatory Budgeting: Axioms and Algorithms.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Defender Stackelberg Game with Inverse Geodesic Length as Utility Metric.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Stability and Pareto Optimality in Refugee Allocation Matchings.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Sub-committee Approval Voting and Generalized Justified Representation Axioms.
Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, 2018

Rank Maximal Equal Contribution: A Probabilistic Social Choice Function.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

On the Complexity of Extended and Proportional Justified Representation.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Knowledge, Fairness, and Social Constraints.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Bounded and envy-free cake cutting.
SIGecom Exch., 2017

Impossibilities for probabilistic assignment.
Soc. Choice Welf., 2017

Justified representation in approval-based committee voting.
Soc. Choice Welf., 2017

Computational aspects of assigning agents to a line.
Math. Soc. Sci., 2017

Sub-committee Approval Voting and Generalised Justified Representation Axioms.
CoRR, 2017

Achieving Proportional Representation via Voting.
CoRR, 2017

A Polynomial-time Algorithm to Achieve Extended Justified Representation.
CoRR, 2017

Fair Allocation based on Diminishing Differences.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Pareto Optimal Allocation under Uncertain Preferences.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Weakening Covert Networks by Minimizing Inverse Geodesic Length.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

The Condorcet Principle for Multiwinner Elections: From Shortlisting to Proportionality.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Coalitional Exchange Stable Matchings in Marriage and Roommate Markets.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Equilibria in Sequential Allocation.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Algorithms for Max-Min Share Fair Allocation of Indivisible Chores.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Complexity of Manipulating Sequential Allocation.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Hedonic Games.
Proceedings of the Handbook of Computational Social Choice, 2016

Review of: The Nature of Computation by Cristopher Moore and Stephan Mertens.
SIGACT News, 2016

A Study of Proxies for Shapley Allocations of Transport Costs.
J. Artif. Intell. Res., 2016

AI's 10 to Watch.
IEEE Intell. Syst., 2016

Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods.
CoRR, 2016

Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences.
CoRR, 2016

Strategyproof Peer Selection.
CoRR, 2016

Computational Complexity of Testing Proportional Justified Representation.
CoRR, 2016

Pareto Optimal Allocation under Uncertain Preferences.
CoRR, 2016

A Comment on the Averseness of Random Serial Dictatorship to Stochastic Dominance Efficiency.
CoRR, 2016

Mechanisms for House Allocation with Existing Tenants under Dichotomous Preferences.
CoRR, 2016

Participation Incentives in Randomized Social Choice.
CoRR, 2016

A discrete and bounded envy-free cake cutting protocol for four agents.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Boolean Hedonic Games.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Control of Fair Division.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Computing Pareto Optimal Committees.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Computational Social Choice: Some Current and New Directions.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Interdependent Scheduling Games.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Welfare of Sequential Allocation Mechanisms for Indivisible Goods.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Egalitarianism of Random Assignment Mechanisms: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Optimal Reallocation under Additive and Ordinal Preferences.
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Strategyproof Peer Selection: Mechanisms, Analyses, and Experiments.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences.
SIGecom Exch., 2015

A note on the undercut procedure.
Soc. Choice Welf., 2015

Competitive equilibrium with equal incomes for allocation of indivisible objects.
Oper. Res. Lett., 2015

Possible and Necessary Winners of Partial Tournaments.
J. Artif. Intell. Res., 2015

Algorithms for two variants of Satisfaction Approval Voting.
CoRR, 2015

Egalitarianism of Random Assignment Mechanisms.
CoRR, 2015

Characterizing SW-Efficiency in the Social Choice Domain.
CoRR, 2015

Generalizing Top Trading Cycles for Housing Markets with Fractional Endowments.
CoRR, 2015

Fair assignment of indivisible objects under ordinal preferences.
Artif. Intell., 2015

Possible and Necessary Allocations via Sequential Mechanisms.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Equilibria Under the Probabilistic Serial Rule.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Welfare Maximization in Fractional Hedonic Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

The Adjusted Winner Procedure: Characterizations and Equilibria.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Online Fair Division: Analysing a Food Bank Problem.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

On the Susceptibility of the Deferred Acceptance Algorithm.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Ex post Efficiency of Random Assignments.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Manipulating the Probabilistic Serial Rule.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
Kurszuordnung über stabile Zuordnungsverfahren.
Wirtschaftsinf., 2014

Computational aspects of random serial dictatorship.
SIGecom Exch., 2014

Review of boolean functions: theory, algorithms, and applications by Yves Crama and Peter L. Hammer.
SIGACT News, 2014

Parametrized algorithms for random serial dictatorship.
Math. Soc. Sci., 2014

Structure and complexity of ex post efficient random assignments.
CoRR, 2014

Strategic aspects of the probabilistic serial rule for the allocation of goods.
CoRR, 2014

A Generalization of the AL method for Fair Allocation of Indivisible Objects.
CoRR, 2014

Testing Top Monotonicity.
CoRR, 2014

Random assignment with multi-unit demands.
CoRR, 2014

Course Allocation via Stable Matching.
Bus. Inf. Syst. Eng., 2014

Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Shapley meets Shapley.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Universal pareto dominance and welfare for plausible utility functions.
Proceedings of the ACM Conference on Economics and Computation, 2014

Fractional hedonic games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Justified Representation in Approval-Based Committee Voting.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

A Generalization of Probabilistic Serial to Randomized Social Choice.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Fixing a Balanced Knockout Tournament.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Computational Aspects of Multi-Winner Approval Voting.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Computation of the random arrival rule for bankruptcy problems.
Oper. Res. Lett., 2013

Testing substitutability of weak preferences.
Math. Soc. Sci., 2013

Pareto optimality in coalition formation.
Games Econ. Behav., 2013

New Cake Cutting Algorithms: a Random Assignment Approach to Cake Cutting.
CoRR, 2013

Computing desirable partitions in additively separable hedonic games.
Artif. Intell., 2013

The Computational Complexity of Random Serial Dictatorship.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

On Popular Random Assignments.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Maximal Recursive Rule: A New Social Decision Scheme.
Proceedings of the IJCAI 2013, 2013

On the tradeoff between economic efficiency and strategy proofness in randomized social choice.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Stable marriage and roommate problems with individual-based stability.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Ties Matter: Complexity of Manipulation when Tie-Breaking with a Random Vote.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Review of in pursuit of the traveling salesman, by William J. Cook.
SIGACT News, 2012

Review of matching theory, by László Lovász and Michael D. Plummer.
SIGACT News, 2012

Individual-based stability in hedonic games depending on the best or worst players.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Existence of stability in hedonic coalition formation games.
Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

Housing Markets with Indifferences: A Tale of Two Mechanisms.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Review of graph theory: a problem oriented approach by Daniel Marcus.
SIGACT News, 2011

False-Name Manipulations in Weighted Voting Games.
J. Artif. Intell. Res., 2011

Path coalitional games
CoRR, 2011

Optimal Partitions in Additively Separable Hedonic Games.
Proceedings of the IJCAI 2011, 2011

Complexity of coalition structure generation.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

Stable partitions in additively separable hedonic games.
Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), 2011

2010
The princeton companion to mathematics by Timothy Gowers, June Barrow-Green and Imre Leader Princeton University Press, 2008.
SIGACT News, 2010

Multiagent systems: algorithmic, game-theoretic, and logical foundations by Y. Shoham and K. Leyton-Brown Cambridge University Press, 2008.
SIGACT News, 2010

Monotone cooperative games and their threshold versions.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

2009
Algorithmic and complexity aspects of simple coalitional games.
PhD thesis, 2009

Review of 'social and economic networks'.
SIGecom Exch., 2009

Spanning connectivity games
CoRR, 2009

Wiretapping a Hidden Network.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

False name manipulations in weighted voting games: splitting, merging and annexation.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Power Indices in Spanning Connectivity Games.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
Computing voting power in easy weighted voting games
CoRR, 2008

Complexity of comparison of influence of players in simple games
CoRR, 2008


  Loading...