Skip to main content

6 Result(s)

within Pallavi Jain Remove this filter Computer Systems Organization and Communication Networks Remove this filter

and

  1. No Access

    Article

    Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules

    Multiwinner elections have proven to be a fruitful research topic with many real-world applications. We contribute to this line of research by improving the state of the art regarding the computational complex...

    Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon in Algorithmica (2023)

  2. No Access

    Chapter and Conference Paper

    More Effort Towards Multiagent Knapsack

    In this paper, we study two multiagent variants of the knapsack problem. Fluschnik et al. [AAAI 2019] studied the model in which each agent expresses its preference by assigning a utility to every item. They s...

    Sushmita Gupta, Pallavi Jain… in SOFSEM 2023: Theory and Practice of Comput… (2023)

  3. No Access

    Chapter and Conference Paper

    Preserving Consistency for Liquid Knapsack Voting

    Liquid Democracy (LD) uses transitive delegations to facilitate joint decision making. In its simplest form, it is used for binary decisions, however its promise holds also for more advanced voting settings. H...

    Pallavi Jain, Krzysztof Sornat, Nimrod Talmon in Multi-Agent Systems (2022)

  4. No Access

    Chapter and Conference Paper

    Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms

    This paper studies gerrymandering on graphs from a computational viewpoint (introduced by Cohen-Zemach et al. [AAMAS 2018] and continued by Ito et al. [AAMAS 2019]). Our contributions are two-fold: conceptual and...

    Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy… in Algorithmic Game Theory (2021)

  5. No Access

    Article

    Parameterized Complexity of Conflict-Free Matchings and Paths

    An input to a conflict-free variant of a classical problem \(\Gamma \)Γ, called Conflict-Free\(\Gamma \)Γ, consists of an instance I of \(\Gamma \)Γ coupled with a graph H, called the conflict graph. A solution t...

    Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Saket Saurabh in Algorithmica (2020)

  6. No Access

    Article

    Gehrlein stability in committee selection: parameterized hardness and algorithms

    In a multiwinner election based on the Condorcet criterion, we are given a set of candidates, and a set of voters with strict preference rankings over the candidates. A committee is weakly Gehrlein stable (WGS) i...

    Sushmita Gupta, Pallavi Jain, Sanjukta Roy… in Autonomous Agents and Multi-Agent Systems (2020)