Zobrazeno 1 - 10
of 111
pro vyhledávání: '"Gupta, Sushmita"'
Over the last decade, extensive research has been conducted on the algorithmic aspects of designing single-elimination (SE) tournaments. Addressing natural questions of algorithmic tractability, we identify key properties of input instances that enab
Externí odkaz:
http://arxiv.org/abs/2408.15068
Autor:
Gupta, Sushmita, Inamdar, Tanmay, Jain, Pallavi, Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket
Classical work on metric space based committee selection problem interprets distance as ``near is better''. In this work, motivated by real-life situations, we interpret distance as ``far is better''. Formally stated, we initiate the study of ``obnox
Externí odkaz:
http://arxiv.org/abs/2405.15372
Autor:
Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita, Jain, Pallavi, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar
In the standard model of fair allocation of resources to agents, every agent has some utility for every resource, and the goal is to assign resources to agents so that the agents' welfare is maximized. Motivated by job scheduling, interest in this pr
Externí odkaz:
http://arxiv.org/abs/2403.04265
Single-elimination (SE) tournaments are a popular format used in competitive environments and decision making. Algorithms for SE tournament manipulation have been an active topic of research in recent years. In this paper, we initiate the algorithmic
Externí odkaz:
http://arxiv.org/abs/2402.06538
A feedback vertex set (FVS) in a digraph is a subset of vertices whose removal makes the digraph acyclic. In other words, it hits all cycles in the digraph. Lokshtanov et al. [TALG '21] gave a factor 2 randomized approximation algorithm for finding a
Externí odkaz:
http://arxiv.org/abs/2402.06407
Allocating conflicting jobs among individuals while respecting a budget constraint for each individual is an optimization problem that arises in various real-world scenarios. In this paper, we consider the situation where each individual derives some
Externí odkaz:
http://arxiv.org/abs/2402.02719
In this paper we study a resource allocation problem that encodes correlation between items in terms of \conflict and maximizes the minimum utility of the agents under a conflict free allocation. Admittedly, the problem is computationally hard even u
Externí odkaz:
http://arxiv.org/abs/2309.04995
In this paper, we study some multiagent variants of the knapsack problem. Fluschnik et al. [AAAI 2019] considered the model in which every agent assigns some utility to every item. They studied three preference aggregation rules for finding a subset
Externí odkaz:
http://arxiv.org/abs/2208.02766
Partitioning a region into districts to favor a particular candidate or a party is commonly known as gerrymandering. In this paper, we investigate the gerrymandering problem in graph theoretic setting as proposed by Cohen-Zemach et al. [AAMAS 2018].
Externí odkaz:
http://arxiv.org/abs/2102.09889
In the Stable Marriage problem. when the preference lists are complete, all agents of the smaller side can be matched. However, this need not be true when preference lists are incomplete. In most real-life situations, where agents participate in the
Externí odkaz:
http://arxiv.org/abs/2005.08150