default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaris Aziz 0001
- > Home > Persons > Haris Aziz 0001
Publications
- 2020
[j44]Haris Aziz
, Simon Mackenzie:
A bounded and envy-free cake cutting algorithm. Commun. ACM 63(4): 119-126 (2020)- 2018
- [j31]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh:
Fixing balanced knockout and double elimination tournaments. Artif. Intell. 262: 1-14 (2018) - 2017
- [j25]Haris Aziz, Simon Mackenzie:
Bounded and envy-free cake cutting. SIGecom Exch. 15(2): 30-33 (2017) - [c63]Haris Aziz, Sylvain Bouveret, Jérôme Lang, Simon Mackenzie:
Complexity of Manipulating Sequential Allocation. AAAI 2017: 328-334 - 2016
- [c51]Haris Aziz, Aris Filos-Ratsikas, Jiashu Chen, Simon Mackenzie, Nicholas Mattei:
Egalitarianism of Random Assignment Mechanisms: (Extended Abstract). AAMAS 2016: 1267-1268 - [c49]Haris Aziz, Simon Mackenzie:
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. FOCS 2016: 416-427 - [c42]Haris Aziz, Simon Mackenzie:
A discrete and bounded envy-free cake cutting protocol for four agents. STOC 2016: 454-464 - [i54]Haris Aziz, Sylvain Bouveret, Jérôme Lang, Simon Mackenzie:
Complexity of Manipulating Sequential Allocation. CoRR abs/1602.06940 (2016) - [i48]Haris Aziz, Simon Mackenzie:
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents. CoRR abs/1604.03655 (2016) - 2015
- [j21]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227: 71-92 (2015) - [j17]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences. SIGecom Exch. 14(2): 16-21 (2015) - [c39]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. AAMAS 2015: 107-115 - [c37]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Manipulating the Probabilistic Serial Rule. AAMAS 2015: 1451-1459 - [c36]Haris Aziz, Simon Mackenzie, Lirong Xia, Chun Ye:
Ex post Efficiency of Random Assignments. AAMAS 2015: 1639-1640 - [c32]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Equilibria Under the Probabilistic Serial Rule. IJCAI 2015: 1105-1112 - [i41]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Manipulating the Probabilistic Serial Rule. CoRR abs/1501.06626 (2015) - [i39]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Nina Narodytska, Toby Walsh:
Equilibria Under the Probabilistic Serial Rule. CoRR abs/1502.04888 (2015) - [i35]Haris Aziz, Jiashu Chen, Aris Filos-Ratsikas, Simon Mackenzie, Nicholas Mattei:
Egalitarianism of Random Assignment Mechanisms. CoRR abs/1507.06827 (2015) - [i34]Haris Aziz, Simon Mackenzie:
A Discrete and Bounded Envy-free Cake Cutting Protocol for Four Agents. CoRR abs/1508.05143 (2015) - 2014
- [c29]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. MPREF@AAAI 2014 - [c28]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh:
Fixing a Balanced Knockout Tournament. AAAI 2014: 552-558 - [c27]Haris Aziz, Serge Gaspers, Simon Mackenzie, Nicholas Mattei, Paul Stursberg, Toby Walsh:
Fixing a Balanced Knockout Tournament. MPREF@AAAI 2014 - [c23]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Fair assignment of indivisible objects under ordinal preferences. AAMAS 2014: 1305-1312 - [i24]Haris Aziz, Serge Gaspers, Joachim Gudmundsson, Simon Mackenzie, Nicholas Mattei, Toby Walsh:
Computational Aspects of Multi-Winner Approval Voting. CoRR abs/1407.3247 (2014) - [i21]Haris Aziz, Simon Mackenzie, Lirong Xia, Chun Ye:
Structure and complexity of ex post efficient random assignments. CoRR abs/1409.6076 (2014) - 2013
- [i14]Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Fair assignment of indivisible objects under ordinal preferences. CoRR abs/1312.6546 (2013)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-08-19 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
