World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
4412
World Ranking
11802
National Ranking
360

Overview

Haris Aziz is affiliated with the University of New South Wales in Australia. Their research spans fields including Economics, Econometrics and Finance, as well as Decision Sciences, with significant focus on subfields such as Economics and Econometrics, Management Science and Operations Research, Safety Research, Artificial Intelligence, and Computer Networks and Communications.

The scientist's main topics of study include Game Theory and Voting Systems, Auction Theory and Applications, Economic Theories and Models, Experimental Behavioral Economics Studies, Optimization and Search Problems, Complexity and Algorithms in Graphs, and Decision-Making and Behavioral Economics.

Among recent papers authored or co-authored by Haris Aziz are:

  • Fair division of indivisible goods: Recent progress and open questions (2023) published in Artificial Intelligence
  • Housing Markets with Indifferences: A Tale of Two Mechanisms (2021) published in Proceedings of the AAAI Conference on Artificial Intelligence
  • Fair allocation of indivisible goods and chores (2021) published in Autonomous Agents and Multi-Agent Systems
  • Task Allocation Using a Team of Robots (2022) published in Current Robotics Reports
  • From Matching with Diversity Constraints to Matching with Regional Quotas (2020) published in arXiv (Cornell University)

Frequent co-authors collaborating with Haris Aziz include Toby Walsh, Mashbat Suzuki, Bo Li, Xinhang Lu, and Barton E. Lee.

Their works are frequently published in venues such as arXiv (Cornell University), Proceedings of the AAAI Conference on Artificial Intelligence, Artificial Intelligence, Autonomous Agents and Multi-Agent Systems, and ACM SIGecom Exchanges.

Haris Aziz has also contributed to book publications, including a title published by Springer Science+Business Media, specifically AI 2022: Advances in Artificial Intelligence (2022).

Best Publications

  • Justified representation in approval-based committee voting

    Haris Aziz;Markus Brill;Vincent Conitzer;Edith Elkind

  • Fair assignment of indivisible objects under ordinal preferences

    Haris Aziz;Serge Gaspers;Simon Mackenzie;Toby Walsh

  • A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents

    Haris Aziz;Simon Mackenzie

  • Fractional Hedonic Games

    Haris Aziz;Florian Brandl;Felix Brandt;Paul Harrenstein

  • Fair Allocation of Indivisible Goods and Chores

    Haris Aziz;Ioannis Caragiannis;Ayumi Igarashi;Toby Walsh

  • Computational Aspects of Multi-Winner Approval Voting

    Haris Aziz;Serge Gaspers;Joachim Gudmundsson;Simon Mackenzie

  • Computing desirable partitions in additively separable hedonic games

    Haris Aziz;Felix Brandt;Hans Georg Seedig

  • Pareto optimality in coalition formation

    Haris Aziz;Felix Brandt;Paul Harrenstein

  • Participatory Budgeting: Models and Approaches

    Haris Aziz;Nisarg Shah

  • Online fair division: analysing a food bank problem

    Martin Aleksandrov;Haris Aziz;Serge Gaspers;Toby Walsh

  • Algorithms for Max-Min Share Fair Allocation of Indivisible Chores

    Haris Aziz;Gerhard Rauchecker;Guido Schryen;Toby Walsh

  • The computational complexity of random serial dictatorship

    Haris Aziz;Felix Brandt;Markus Brill

  • Fair Allocation of Indivisible Goods and Chores.

    Haris Aziz;Ioannis Caragiannis;Ayumi Igarashi;Toby Walsh;Toby Walsh

  • Housing markets with indifferences: a tale of two mechanisms

    Haris Aziz;Bart De Keijzer

  • A discrete and bounded envy-free cake cutting protocol for four agents

    Haris Aziz;Simon Mackenzie

  • Stable partitions in additively separable hedonic games

    Haris Aziz;Felix Brandt;Hans Georg Seedig

  • On the tradeoff between economic efficiency and strategy proofness in randomized social choice

    Haris Aziz;Felix Brandt;Markus Brill

  • Proportionally Representative Participatory Budgeting: Axioms and Algorithms

    Haris Aziz;Barton E. Lee;Nimrod Talmon

  • Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations

    Haris Aziz;Chun Ye

  • Online Fair Division: analysing a Food Bank problem

    Martin Aleksandrov;Haris Aziz;Serge Gaspers;Toby Walsh

  • Fractional hedonic games

    Haris Aziz;Felix Brandt;Paul Harrenstein

  • On the Complexity of Extended and Proportional Justified Representation.

    Haris Aziz;Edith Elkind;Shenwei Huang;Martin Lackner

  • A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation

    Haris Aziz;Haris Aziz;Hervé Moulin;Hervé Moulin;Fedor Sandomirskiy;Fedor Sandomirskiy

  • Efficient Algorithm for Designing Weighted Voting Games

    H. Aziz;M. Paterson;D. Leech

  • Existence of stability in hedonic coalition formation games

    Haris Aziz;Florian Brandl

  • Optimal partitions in additively separable hedonic games

    Haris Aziz;Felix Brandt;Hans Georg Seedig

Frequent Co-Authors

Toby Walsh
Toby Walsh University of New South Wales
Felix Brandt
Felix Brandt Technical University of Munich
Jérôme Lang
Jérôme Lang Paris Dauphine University
Mike Paterson
Mike Paterson University of Warwick
Lirong Xia
Lirong Xia Rutgers, The State University of New Jersey
Edith Elkind
Edith Elkind University of Oxford
Ioannis Caragiannis
Ioannis Caragiannis Aarhus University
David C. Parkes
David C. Parkes Harvard University
Jeffrey S. Rosenschein
Jeffrey S. Rosenschein Hebrew University of Jerusalem
Joachim Gudmundsson
Joachim Gudmundsson University of Sydney

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science opens up a range of pathways for students from diverse backgrounds. For those seeking a flexible, entry-level option, earning an online associate degree in computer science can provide foundational skills while reducing costs and time commitments.

If you already have a bachelor's degree, pursuing one of the most valuable masters degrees in computer science or related fields can significantly enhance your qualifications for in-demand, high-paying roles.

Affordability and accessibility are key considerations for many prospective students. Fortunately, there are many affordable online courses and programs available, making it easier to balance education costs with future career goals.

For those concerned about previous academic performance, some online graduate schools with low gpa requirements offer opportunities to advance your education and career. Overall, online options make computer science education more accessible and customizable to your unique situation.

Best Scientists Citing Haris Aziz

Trending Scientists

Recently Published Articles