Contact:
Sujoy Kumar Sikdar
Amos Eaton AE 204
Rensselaer Polytechnic Institute
110, 8th Street, Troy, NY 12180
[CV] [Google Scholar] [Linkedin]
I graduated in December 2018! My new homepage is at https://sujoyksikdar.github.io/
As a PhD student Computer Science Department at the Rensselaer Polytechnic Institute, I was most fortunate to be advised by Prof. Sibel Adalı and Prof. Lirong Xia.
▪ 2012 - 2018 (Summer, expected), Doctor of Philosophy, Computer Science, Rensselaer Polytechnic Institute, Troy, NY.
Thesis: Optimal Multi-Attribute Decision Making in Social Choice Problems.
Advisers: Prof. Lirong Xia and Prof. Sibel Adalı.
▪ 2012 - 2015, Master of Science, Computer Science, Rensselaer Polytechnic Institute, Troy, NY.
Thesis: Towards an Understanding of Information Credibility on Online Social Networks.
Advisers: Prof. Sibel Adalı.
▪ 2005 - 2009, Bachelor of Engineering, Information Technology, Manipal Institute of Technology, Manipal, India.
Computational Social Choice, Mechanism Design, Human Decision-Making, Trust and Credibility on Social Networks, Information Aggregation, Artificial Intelligence, Algorithm Design, Machine Learning.
I am interested in (optimal) decision making over multiple attributes or issues in social and individual choice which includes the following problems:
Multi-Resource Allocation: Fair and Efficient allocation of mutiple types of items in Allocation and Exchange Markets.
Combinatorial voting: Making a group decision over multiple issues.
Human Behavior on Social Networks: Modeling human choices and decision-making in real data.
Please find a more detailed description of my research activities below.
My MS and PhD theses concentrated on decision making problems in multi-attribute domains through theory as well as real-world applications. I approach these problems from two directions:
(Direction 1) The social choice problem of Making Optimal Decisions under Preferences.
Multi-Resource Allocation: Allocation and Exchange Markets involving items of mulitple types.
▪ We provide the first positive results in mechanism design for multi-type exchange markets. In exchange markets, the resources are initially owned by the agents and the goal is to find an optimal and stable redistribution of resources, while ensuring participation. Participation is a particularly important property for a centralized mechanism when parallel markets are undesirable such as in paired organ donation, assigning students to courses of multiple types to satisfy graduation requirements, allocation of dorm rooms and other facilities in a university, and reassigning computational resources in a cloud computing platform. Our mechanism satisfies strict-core selection, non-bossiness and a restricted version of strategyproofness under some natural structural assumptions on agents' combinatorial preferences over bundles.
▪ In the allocation problem, the goal is to allocate bundles of resources given agents' preferences. We characterize sequential mechanisms, study their social choice and computational properties and provide rank efficiency bounds when agents are strategic. Sequential mechanisms are desirable for their simplicity and the property that agents are not required to form their full combinatorial preferences a priori. An example is the problem of assigning a research paper and time slot to students in a seminar course given their preferences.
Combinatorial voting: Making a group decision over multiple issues such as the decision on multiple referenda or deciding a menu for a dinner party. We provide the first framework to reason about optimal decisions when agents' preferences are represented by CP and PCP-nets with full generality. CP-nets are a popular language to represent agents' combinatorial preferences over multiple issues allowing agents to specify conditional preferential dependencies on the values for different types. Our framework leads to a natural optimization objective while previous works imposed various restrictions on agents' preference structures. A new class of voting rules under our framework allows the aggregation of profiles of CP-net preferences without any assumptions on the structure of preferences.
(Direction 2) Learning Preferences from real world Data.
Human Behavior on Social Networks: Modeling human choices and decision-making through voting and discussion behavior on social networks using data mining, NLP, machine learning, and learning-to-rank techniques. We provide new insights into what drives conversations on social content sharing and discussion platforms such as Reddit using models that learn to rank comments. We develop natural language features to model the factors affecting voting behavior. Our supervised machine learning methods rank the comments with high precision and are human interpretable. We show that our methods are effective across a diverse set of communities that deal with topics as diverse as question answering communities dealing with science and history to communities that discuss news and politics. A post hoc analysis reveals new insights into factors affecting users' voting behavior.
Human Choices in Question Answering: In collaboration with social psychologists, we develop models inspired by psychology literature to understand why certain answers are more popular in a dataset obtained in a controlled environment.
Computational Social Choice, Game Theory, Machine Learning, Analysis of Algorithms, Approximation Algorithms, Intro. to Computational Finance, Distributed Computing Over the Internet, Frontiers of Network Science, Mathematical Statistics, Linear Programming.