4 papers · 1 filter
MLN-EIGS: A multilayer network framework for solving Stackelberg escape interdiction games on dynamic transportation networks
Sukanya Samanta, Kei Kimura, Makoto Yokoo +1
Interdicting an escaping criminal with limited police resources on large-scale transportation networks is a challenging problem due to the dynamic nature of both attacker movement…
Fair, Efficient and Connected Allocations on Graphs
Susobhan Bandopadhyay, Anish Datta, Palash Dey +2
We study the classical and parameterized complexity of efficient connected allocation problems on graphs, where efficiency is measured by egalitarian and utilitarian welfare maximi…
Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
Palash Dey, Anubhav Dhar, Ashlesha Hota +2
In this paper, we study the Maximum Common Vertex Subgraph problem: Given two input graphs and a non-negative integer , is there a common subgraph on at least …
Fair Distribution of Digital Payments: Balancing Transaction Flows for Regulatory Compliance
Ashlesha Hota, Shashwat Kumar, Daman Deep Singh +3
The concentration of digital payment transactions in just two UPI apps like PhonePe and Google Pay has raised concerns of duopoly in India s digital financial ecosystem. To address…