Skip to main content

10 Result(s)

within Pallavi Jain Remove this filter Artificial Intelligence Remove this filter

and

  1. 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)

  2. 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)

  3. No Access

    Chapter and Conference Paper

    Gehrlein Stable Committee with Multi-modal Preferences

    Inspired by Gehrlein stability in multiwinner election, in this paper, we define several notions of stability that are applicable in multiwinner elections with multimodal preferences, a model recently proposed...

    Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy… in Algorithmic Game Theory (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

    Chapter and Conference Paper

    Circumventing Connectivity for Kernelization

    Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is c...

    Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy… in Algorithms and Complexity (2021)

  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)

  7. No Access

    Chapter and Conference Paper

    List Colouring of Graphs Using a Genetic Algorithm

    The List Colouring Problem (LCP) is an NP-Hard optimization problem in which the goal is to find a proper list colouring of a graph G = (V, E) such that the number of colours used is minimized. This paper deals w...

    Aditi Khandelwal, Pallavi Jain, Gur Saran in Smart Computing and Informatics (2018)

  8. No Access

    Chapter and Conference Paper

    Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

    Let \(\mathrm{\Pi }\) be a family of graphs. In the classical

    Pallavi Jain, Lawqueen Kanesh… in Computer Science – Theory and Applications (2018)

  9. No Access

    Article

    Minimizing cyclic cutwidth of graphs using a memetic algorithm

    Cyclic cutwidth minimization problem (CCMP) consists of embedding a graph onto a circle such that the maximum cutwidth in a region is minimized. It is an NP-complete problem and for some classes of graphs, exa...

    Pallavi Jain, Kamal Srivastava, Gur Saran in Journal of Heuristics (2016)

  10. No Access

    Chapter and Conference Paper

    Branch and Bound Algorithm for Vertex Bisection Minimization Problem

    Vertex Bisection Minimization problem (VBMP) consists of partitioning the vertex set V of a graph G = (V, E) into two sets B and B′ where ...

    Pallavi Jain, Gur Saran, Kamal Srivastava in Advanced Computing and Communication Techn… (2016)