Introduction
I am currently a European Science Foundation (ESF) postdoctoral researcher in a Europe-wide collaborative research project on "Computational Foundations of Social Choice" and am based in the PAMAS research group at the Ludwig-Maximilians-University Munich.
I was previously a doctoral researcher at the Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick.
I completed an MSc in Mathematics & Foundations of Computer Science from University of Oxford and BSc (Honours) Computer Science from Lahore University of Management Sciences (LUMS).
Contact:
Computer Science Department
Theoretical Computer Science
Oettingenstr. 67
80538 Munich, Germany
General Research Interests: Theoretical computer science, algorithms & complexity, game theory, discrete mathematics and multiagent systems.
Key words: Discrete applied mathematics; combinatorial optimization; computational social choice; multiagent systems; game theory; mechanism design; social choice & voting; coalition formation; computational complexity; social, economic and information networks; cooperative game theory; Boolean functions; network reliability; approximation algorithms; models and algorithms for the web.
PhD Research: Simple coalitional games are a fundamental class of cooperative games and voting games which are used to model coalition formation, resource allocation and decision making in computer science, artificial intelligence and multiagent systems. My thesis focused on algorithmic and computational complexity aspects of simple coalitional games including those which are in network settings.
PhD supervisor: Prof. Mike Paterson, co-supervisor: Prof. Dennis Leech.
PhD thesis committee: Prof. Paul Goldberg, Prof. Artur Czumaj and Prof. Alex Tiskin.
Publications
- H. Aziz, F. Brandt, and P. Harrenstein. Monotone cooperative games and their threshold versions. 2009. Working paper.
-
H. Aziz, O. Lachish, M. Paterson and R. Savani. Wiretapping a hidden network. WINE 2009, International Workshop on Internet & Network Economics 2009. LNCS 5929 proceedings. Preprint
-
H. Aziz, O. Lachish, M. Paterson and R. Savani. Power indices of spanning connectivity games. AAIM 2009, The Fifth International Conference on Algorithmic Aspects in Information and Management, LNCS 5564 proceedings. Link Proceedings Preprint
-
H. Aziz and M. Paterson. False name manipulations in weighted voting games: splitting, merging and annexation. AAMAS 2009, The Eighth International Conference on Autonomous Agents and Multiagent Systems. Link Proceedings Pdf
-
H. Aziz, Algorithmic and computational complexity aspects of simple coalitional games. PhD thesis, 2009.
-
H. Aziz, Complexity of comparison of influence of players in simple games. Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC), pp 61-72, 2008. Link Proceedings Pdf
-
H. Aziz and M. Paterson. Complexity of some aspects of control and manipulation in weighted voting games. Annales du Lamsade, No. 9, pp 1-16, 2008 ISSN 1762-455X. Link
-
H. Aziz and M. Paterson. Classification of computationally tractable weighted voting games. Lecture Notes in Engineering and Computer Science, World Congress on Engineering 2008, Volume 1, pp 129-134 Link Pdf (Initial version as H. Aziz and M. Paterson, Computing voting power in easy weighted voting games, CO 2008 - International Symposium on Combinatorial Optimization 2008. Link).
-
H. Aziz, M. Paterson, D. Leech. Efficient algorithm for Designing Weighted Voting Games. Proceedings of the IEEE Computer Society, 11th IEEE International Multitopic Conference. Link Pdf
-
H. Aziz and M. Paterson. Computational and combinatorial aspects of multiple weighted voting games. (Preliminary version), Proceedings of ACiD (Algorithms & Complexity in Durham) Workshop 2007, Durham, UK. Link
-
D. Leech and H. Aziz. The double majority voting rule of the EU reform treaty as a democratic ideal for an enlarging union: an appraisal using voting power analysis. Proceedings of Annual Meeting of the European Public Choice Society 2008, Jena, Germany. Link Pdf (Previously as D. Leech and H. Aziz, 'Some Properties of the Qualified Majority Voting Provisions of the EU Constitutional Treaty under Various Enlargement Scenarios', International Workshop on the Distribution of Voting Power in the EU, Warsaw, 2007).
- H. Aziz. Simple games: complexity of length, duality and optimal bribery. Sixth European Workshop on Multi-Agent Systems 2008.
-
H. Aziz. Social and Economic Networks: a review. ACM Sigecom Exchanges Volume 8.1, 2009 Link Pdf
- H. Aziz and M. Heuer (Editors). 19th Postgraduate Combinatorial Conference (BCC-LMS-DIMAP-OU) Proceedings'. 2008. Link
-
H. Aziz. Review of 'Is Mathematics Inevitable? A Miscellany'. 2008. London Mathematical Society Newsletter, Issue 375, Nov 2008 Link
-
H. Aziz. Review of 'Algorithmic aspects of graph connectivity (1st ed.)' by H. Nagamochi and T. Ibaraki. ACM Computing Reviews, 2008 Link
-
H. Aziz. Review of 'Princeton Companion to Mathematics' by Gowers, Barrow-Green and Leader. ACM SIGACT News (To be published)
-
H. Aziz. 'Insight into Game Theory', IMA Mathematics Today. Volume 45, Number 2, February 2009, Page 33 Link Pdf
-
H. Aziz. Complex graphs and networks (CBMS regional conference series in mathematics): a review. ACM Computing Reviews, 2009. Link
-
H. Aziz. Algorithmic Game Theory: a review, IMA Mathematics Today. Volume 45, Number 2, 2009 Pdf
-
H. Aziz. Review of 'Encyclopedia of Algorithms' by MY Kao. ACM Computing Reviews, 2009 Link
-
H. Aziz. Game Theoretic Problems in Network Economics and Mechanism Design: a review. ACM Computing Reviews, 2009 Link
-
H. Aziz and M. Heuer. "Report on the 19th Postgraduate Combinatorial Conference", London Mathematical Society Newsletter, Oct 2008, Issue 374. Link
-
H. Aziz. Review of 'Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations' by Y. Shoham and K. Leyton-Brown, ACM SIGACT News (To be published).
-
H. Aziz. Review of 'Matching Theory' by László Lovász and M. D. Plummer , 2009 (In preparation).
-
H. Aziz. Loss of two game theorists (Short note). Assumptions, Issue 2 2009
-
H. Aziz. Computing with Social Trust: a review. ACM Computing Reviews, 2009 Link
-
H. Aziz. Computer Science and Economics: a manifesto. Assumptions, Issue 3 2009.
Scientific services
- On the committee of BCTCS (2007-2008), BCC (2007-2008), EASSS08, WPCCS08 and WPPCS07.
- Reviewer Discrete Applied Mathematics, European Journal of Operations Research, The Journal of the Operational Research Society (JORS) , Computer Science Review, ACM Computing Reviews, International Workshop on Internet & Network Economics, AAAI Conference on Artificial Intelligence and International Conference on Autonomous Agents and Multiagent Systems.
- Organizer of the 19th Postgraduate Combinatorial Conference, 2008 (PCC08).
- In the organization team for BCTCS2009 (British Colloquium for Theoretical Computer Science), Mike66 (Theoretical Computer Science workshop), CO2008 (Warwick Business School) and Algorithmic Game Theory Workshop 2008 and member of the 'Mathematics Today' editorial team.
- On the MSc committee of TU Delft, Faculty of Engineering, Mathematics and Computer Science (EWI)
Miscellaneous
- The pervasiveness and importance of algorithms is covered in the Economist and The Guardian. There is more coverage of algorithms is here and here. The NYT looks at the P vs NP question.
- Mathematics can be a profitable profession: check this!
- Eight game theorists have won Nobel prizes in economics.
- Also, check out an article on mechanism design in The Guardian.
- I have an Erdos Number of 3. (Paul Erdos --> {John Conway/David E. Dakin/Foong Frances Yao/ Aviezri Siegmund Fraenkel/ Patrick Eugene O'Neil} --> Michael S. Paterson --> Haris Aziz).
|
|
