“(Big) Networks, Games, and Algorithms”
Location: LTS Auditorium, 8080 Greenmead Drive
Speaker:
Mohammad Hajiaghayi and John Dickerson
Department of Computer Science and UMIACS
Abstract:
In this talk, we briefly survey our work on network design and algorithmic game theory. In particular we talk about our recent results on ways to handle big networks (streaming and map-reduce), Kidney exchange, Blotto games, Voter Authentication games, as well as security games.
The main goal is to demonstrate areas of common interest with LTS.
Speaker Bio:
John Dickerson is an assistant professor of computer science at UMD.
His research centers on solving practical economic problems using techniques from computer science, stochastic optimization, and machine learning.
Dickerson has worked extensively on theoretical and empirical approaches to kidney exchange, where his work has set policy at the UNOS nationwide exchange; game-theoretic approaches to counter-terrorism and negotiation, where his models have been deployed; and computational advertising through Optimized Markets.
He created FutureMatch, a general framework for learning to match subject to human value judgments, which won a 2014 HPCWire Supercomputing Award.
Dickerson is an NDSEG Fellow, Facebook Fellow, and Siebel Scholar.
Mohammad Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science at UMD.
He is also an affiliate professor in the Decision, Operations, and Information Technologies Area of the Robert H. Smith School of Business.
His main area of research is designing algorithmic frameworks for complex networked systems and games.
Hajiaghayi is the recipient of numerous awards including an NSF CAREER Award, an ONR Young Investigator Award, two Google Faculty Research Awards, and more. He has also been awarded grants from DARPA, the Air Force, the Navy, and others.
He has published over 220 papers, received best paper awards, and served on editorial boards of several international journals. Hajiaghayi has 10 granted and two filed U.S. patents.