The University of Southampton
×
Electronics and Computer Science

Dr Bahar Rastegari 

I am a lecturer (assistant professor) in the Agents, Interaction and Complexity (AIC) research group at the School of Electronics and Computer Science, University of Southampton. I enjoy doing research and solving [preferably math-related] problems. Since 2003 I have been mostly focused on designing algorithms and proving theorems in the areas of Game Theory and Bioinformatics. My current research interests include computational social choice and algorithmic mechanism design with particular focus on matching theory.

I received my Ph.D. from the University of British Columbia (UBC), Canada, in 2013. My Ph.D. advisers were Anne Condon and Kevin Leyton-Brown. I also hold an M.Sc. in Computer Science from UBC (2004) and a B.Sc. in Computer Engineering from Sharif University of Technology, Iran (2002). 

From 2013 to 2016, I was a postdoctoral research associate at the School of Computing Science, University of Glasgow. I was working with David Manlove on Efficient Algorithms for Mechanism Design Without Monetary Transfer, a joint EPSRC project between the University of Glasgow and the University of Liverpool. I was a lecturer at the Department of Computer Science, University of Bristol  from April 2017 to August 2018.

Research

Research interests

Multiagent Systems, Algorithmic Game Theory, Algorithmic Mechanism Design, Arti cial Intelligence, Algorithm Design, Operations Research, Computational Complexity Theory, Bioinformatics

Publications

Aziz, Haris, Biro, Peter, de Haan, Ronald and Rastegari, Baharak (2018) Pareto optimal allocation under compact uncertain preferences. Thirty Third AAAI Conference on Artificial Intelligence, Hilton Hawaiian Village, Honolulu, United States. 27 Jan - 01 Feb 2019. (In Press)

Meeks, Kitty and Rastegari, Baharak (2018) Stable marriage with groups of similar agents. In Web and Internet Economics: WINE 2018. vol. 11316, Springer. pp. 312-326 . (doi:10.1007/978-3-030-04612-5_21).

Aziz, Haris, de Haan, Ronald and Rastegari, Baharak (2017) Pareto optimal allocation under uncertain preferences. In, Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems. International Foundation for Autonomous Agents and Multiagent Systems, pp. 1472-1474.

Meeks, Kitty and Rastegari, Baharak (2017) Solving hard stable matching problems involving groups of similar agents. arXiv, [arXiv:1708.04109v1]. (Submitted)

Cechlárová, Katarína, Eirinakis, Pavlos, Fleiner, Tamás, Magos, Dimitrios, Manlove, David F., Mourtos, Ioannis, Oceľáková, Eva and Rastegari, Baharak (2015) Pareto optimal matchings in many-to-many markets with ties. In, Hoefer, M. (ed.) Lecture Notes in Computer Science. (Algorithmic Game Theory, 9347) Berlin; Heidelberg. Springer, pp. 27-39. (doi:10.1007/978-3-662-48433-3_3).

Rastegari, Baharak, Goldberg, Paul W. and Manlove, David (2016) Preference elicitation in matching markets via interviews: a study of offline benchmarks. In, Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. AAMAS '16 International Conference on Autonomous Agents and Multiagent Systems (08/05/16 - 13/05/16) Richland. International Foundation for Autonomous Agents and Multiagent Systems, pp. 1393-1394.

Aziz, Haris, Biró, Péter, Gaspers, Serge, De Haan, Ronald, Mattei, Nicholas and Rastegari, Baharak (2016) Stable matching with uncertain linear preferences. In, Gairing, M. and Savani, R. (eds.) Lecture Notes in Computer Science. (Algorithmic Game Theory. SAGT 2016, 9928) Berlin; Heidelberg. Springer, pp. 195-206. (doi:10.1007/978-3-662-53354-3_16).

Cechlárová, Katarína, Eirinakis, Pavlos, Fleiner, Tamás, Magos, Dimitrios, Manlove, David, Mourtos, Ioannis, Ocel̆áková, Eva and Rastegari, Baharak (2016) Pareto optimal matchings in many-to-many markets with ties. Theory of Computing Systems, 59 (4), 700-721. (doi:10.1007/s00224-016-9677-1).

Rastegari, Baharak, Condon, Anne, Immorlica, Nicole, Irving, Robert and Leyton-brown, Kevin (2014) Reasoning about optimal stable matchings under partial information. In Proceedings of the Fifteenth ACM Conference on Economics and Computation. ACM. pp. 431-448 . (doi:10.1145/2600057.2602884).

Andronescu, Mirela and Rastegari, Baharak (2003) Motif-grasp and motif-ils: two new stochastic local search algorithms for motif finding. Mini Workshop on Stochastic Search Algorithms, Room 1613, Forest Sciences Centre, University of British Columbia, Vancouver, Canada. 25 Apr 2003. 68 pp .

Condon, Anne, Davy, Beth, Rastegari, Baharak, Zhao, Shelly and Tarrant, Finbarr (2004) Classifying RNA pseudoknotted structures. Theoretical Computer Science, 320 (1), 35-50. (doi:10.1016/j.tcs.2004.03.042).

Ren, Jihong, Rastegari, Baharak, Condon, Anne and Hoos, Holger H. (2005) HotKnots: heuristic prediction of RNA secondary structures including pseudoknots. RNA, 11 (10), 1494-1504. (doi:10.1261/rna.7284905).

Rastegari, Baharak and Condon, Anne (2005) Linear time algorithm for parsing RNA secondary structure. In, Casadio, R. and Myers, G. (eds.) Algorithms in Bioinformatics. WABI 2005. (Lecture Notes in Computer Science: Algorithms in Bioinformatics, 3692) Berlin; Heidelberg. Springer, pp. 341-352. (doi:10.1007/11557067_28).

Rastegari, Baharak and Condon, Anne (2007) Parsing nucleic acid pseudoknotted secondary structure: algorithm and applications. Journal of Computational Biology, 14 (1), 16-32. (doi:10.1089/cmb.2006.0108).

Rastegari, Baharak, Condon, Anne and Leyton-Brown, Kevin (2007) Revenue monotonicity in combinatorial auctions. Artificial Intelligence, 175 (2), 45-47.

Rastegari, Baharak, Condon, Anne and Leyton-brown, Kevin (2009) Stepwise randomized combinatorial auctions achieve revenue monotonicity. In, Mathieu, Claire (ed.) Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. (Proceedings, PR132) Philadelphia. Society for Industrial and Applied Mathematics, pp. 738-747. (doi:10.1137/1.9781611973068.81).

Rastegari, Baharak, Condon, Anne and Leyton-brown, Kevin (2011) Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions. Artificial Intelligence, 175 (2), 441-456. (doi:10.1016/j.artint.2010.08.005).

Rastegari, Baharak, Condon, Anne, Immorlica, Nicole and Leyton-brown, Kevin (2013) Two-sided matching with partial information. In EC '13 Proceedings of the Fourteenth ACM Conference on Electronic Commerce. ACM. pp. 733-750 . (doi:10.1145/2492002.2482607).

Krysta, Piotr, Manlove, David, Rastegari, Baharak and Zhang, Jinshan (2014) Size versus truthfulness in the house allocation problem. In EC '14 Proceedings of the fifteenth ACM conference on Economics and computation. ACM. pp. 453-470 . (doi:10.1145/2600057.2602868).

Krysta, Piotr, Manlove, David, Rastegari, Baharak and Zhang, Jinshan (2019) Size versus truthfulness in the House Allocation problem. Algorithmica, 81 (9), 3422-3463. (doi:10.1007/s00453-019-00584-7).

Aziz, Haris, Biró, Péter, de Haan, Ronald and Rastegari, Baharak (2019) Pareto optimal allocation under uncertain preferences: Uncertainty models, algorithms, and complexity. Artificial Intelligence, 276, 57-78. (doi:10.1016/j.artint.2019.08.002).

Aziz, Haris, Biró, Péter, Gaspers, Serge, de Haan, Ronald, Mattei, Nicholas and Rastegari, Baharak (2019) Stable matching with uncertain linear preferences. Algorithmica. (doi:10.1007/s00453-019-00650-0).

Burmann, Jan, Gerding, Enrico and Rastegari, Baharak (2020) Fair allocation of resources with uncertain availability. Nineteenth International Conference on Autonomous Agents and Multi-Agent Systems, , Auckland, New Zealand. 09 - 13 May 2020. 9 pp .

Meeks, Kitty and Rastegari, Baharak (2020) Solving hard stable matching problems involving groups of similar agents. Theoretical Computer Science, 844, 171-194. (doi:10.1016/j.tcs.2020.08.017).

Aziz, Haris, Biró, Péter, Fleiner, Tamás, Gaspers, Serge, de Haan, Ronald, Mattei, Nicholas and Rastegari, Baharak (2022) Stable matching with uncertain pairwise preferences. Theoretical Computer Science, 909, 1-11. (doi:10.1016/j.tcs.2022.01.028).

Share this profile FacebookTwitterWeibo