On the Exact Amount of Missing Information that makes Finding Possible Winners Hard Dey P., Misra N. By Journal of Computer and System Sciences - (Accepted/In-Press)
A parameterized perspective on protecting elections Dey P., Misra N. , Nath S. , Shakya G. By Theoretical Computer Science 874 15-31 (2021)
Distance Restricted Manipulation in Voting Dey P., Anand A. By Theoretical Computer Science 849 149-165 (2021)
Local Distance Constrained Bribery in Voting Dey P. By Theoretical Computer Science 849 1-21 (2021)
Predicting winner and estimating margin of victory in elections using sampling Bhattacharyya A., Dey P. By Artificial Intelligence 296 103476- (2021)
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems Dey P., Bhattacharyya A. , Woodruff D. By ACM Transactions on Algorithms 15 1-27 (2019)
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers Dey P., Misra N. , Narahari Y. By Theoretical Computer Science 783 53-70 (2019)
Complexity of Manipulation with Partial Information in Voting Dey P., Misra N. , Narahari Y. By Theoretical Computer Science 726 78-99 (2018)
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences Dey P. By Theoretical Computer Science 731 36-49 (2018)
Frugal Bribery in Voting Dey P., Misra N. , Narahari Y. By Theoretical Computer Science 676 15-32 (2017)
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting Dey P., Misra N. , Narahari Y. By Theoretical Computer Science 616 111-125 (2016)
Asymptotic collusion-proofness of voting rules: the case of large number of candidates Dey P., Narahari Y. By Studies in Microeconomics 120-139 (2015)
Conferences
Representation-based Individual Fairness in k-clustering Kar D., Kosan M. , Mandal D. , Medya S. , Silva A. , Dey P. , Sanyal S. By International Conference on Autonomous Agents and Multiagent Systems - (Accepted/In-Press)
On Parameterized Complexity of Binary Networked Public Goods Game Maiti A., Dey P. By International Conference on Autonomous Agents and Multi-Agent Systems 871-879 (2022)
Parameterized Algorithms for Kidney Exchange Maiti A., Dey P. By International Joint Conference on Artificial Intelligence 405-411 (2022)
How Hard is Safe Bribery? Karia N., Mallick F. , Dey P. By International Conference on Autonomous Agents and Multi-Agent Systems 714-722 (2022)
Priced Gerrymandering Dey P. By International Conference on Autonomous Agents and Multi-Agent Systems 1575-1577 (2022)
Fair Partitioning of Public Resources: Redrawing District Boundary to Minimize Spatial Inequality in School Funding Mota N., Mohammadi N. , Dey P. , Gummadi K. P., Chakraborty A. By The Web Conference 2021 646-657 (2021)
Network Robustness via Global k-cores Dey P., Maity S. K., Medya S. , Silva A. By 20th International Conference on Autonomous Agents and Multiagent Systems 438-446 (2021)
On Parameterized Complexity of Liquid Democracy Dey P., Maiti A. , Sharma A. By 7th International Conference Algorithms and Discrete Applied Mathematics 83-94 (2021)
Manipulating Node Similarity Measures in Networks Dey P., Medya S. By Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems - (2020)
Minimizing Margin of Victory for Fair Political and Educational Districting Stoica A. A., Chakraborty A. , Dey P. , Gummadi K. P. By Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems - (2020)
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules Sonar C., Dey P. , Misra N. By Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence - (2020)
Improved Explicit Data Structures in the Bit-probe Model using Error Correcting Codes Dey P., Radhakrishnan J. , Velusamy S. By Prodeesings of the 45th International Symposium on Mathematical Foundations of Computer Science - (2020)
Covert Networks: How Hard is It to Hide? Dey P., Medya S. By Autonomous Agents and MultiAgent Systems 628-637 (2019)
A Parameterized Perspective on Protecting Elections Dey P., Misra N. , Nath S. , Shakya G. By Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI) 238-244 (2019)
Testing Preferential Domains using Sampling Dey P., Nath S. , Shakya G. By Autonomous Agents and MultiAgent Systems 855-863 (2019)
The Social Network Effect on Surprise in Elections Dey P., Kothari P. , Nath S. By ACM India Joint International Conference on Data Science & Management of Data 1-9 (2019)
Local Distance Restricted Bribery in Voting Dey P. By International Conference on Autonomous Agents and Multiagent Systems 1925-1927 (2019)
Manipulative Elicitation -- A New Attack on Elections with Incomplete Preferences Dey P. By AAAI conference on Artificial Intelligence 4670-4677 (2018)
On the Exact Amount of Missing Information that makes Finding Possible Winners Hard Dey P., Misra N. By International Symposium on Mathematical Foundations of Computer Science 1-14 (2017)
Parameterized Dichotomy of Choosing Committees Based on Approval Votes in the Presence of Outliers Dey P., Misra N. , Narahari Y. By Conference on Autonomous Agents and MultiAgent Systems (AAMAS) 42-50 (2017)
Proportional Representation in Vote Streams Dey P., Talmon N. , Van Handel O. By International Conference on Autonomous Systems and Multiagent Systems (AAMAS-17) 15-23 (2017)
Query Complexity of Tournament Solutions Dey P. By AAAI conference on Artificial Intelligence 2992-2998 (2017)
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems Dey P., Bhattacharyya A. , Woodruff D. By ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems 385-400 (2016)
Elicitation for Preferences Single Peaked on Trees Dey P., Misra N. By International Joint Conference on Artificial Intelligence 215-221 (2016)
Frugal Bribery in Voting Dey P., Misra N. , Narahari Y. By AAAI Conference on Artificial Intelligence 2466-2473 (2016)
Complexity of Manipulation with Partial Information in Voting Dey P., Misra N. , Narahari Y. By International Joint Conference on Artificial Intelligence 229-235 (2016)
Preference Elicitation for Single Crossing Domain Dey P., Misra N. By International Joint Conference on Artificial Intelligence 222-228 (2016)
Computational Complexity of Fundamental Problems in Social Choice Theory Dey P. By International Conference on Autonomous Agents and Multiagent Systems 1973-1974 (2015)
Detecting Possible Manipulators in Elections Dey P., Misra N. , Narahari Y. By International Conference on Autonomous Agents and Multiagent Systems 1441-1450 (2015)
Estimating the Margin of Victory of an Election Using Sampling Dey P., Narahari Y. By International Joint Conference on Artificial Intelligence 1120-1126 (2015)
Kernelization Complexity of Possible Winner and Coalitional Manipulation Problems in Voting Dey P., Misra N. , Narahari Y. By International Conference on Autonomous Agents and Multiagent Systems 87-96 (2015)
Sample Complexity for Winner Prediction in Elections Dey P., Bhattacharyya A. By International Conference on Autonomous Agents and Multiagent Systems 1421-1430 (2015)
Asymptotic collusion-proofness of voting rules: the case of large number of candidates Dey P., Narahari Y. By International Conference on Autonomous Agents and Multiagent Systems 1419-1420 (2014)
UNO Gets Easier for a Single Player Dey P., Goyal P. , Misra N. By Fun with Algorithms 147-157 (2014)
Dynamic Multipath Bandwidth Provisioning with Jitter, Throughput, SLA Constraints in MPLS over WDM Network Dey P., Kundu A. , Naskar M. K., Mukherjee A. , Nasipuri M. By Internation Conference on Distributed Computing and Networking 376-391 (2010)
Completed Projects
Principal Investigator
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
