3 citations · 4 across the 11 of their papers we have counts for
12 papers
Menu Selection: A Computational Approach to Minimizing Food Waste
Haris Aziz, Nicholas Mattei, Shivika Narang +1
We introduce a novel collective decision making problem that captures the ubiquitous issue of ordering food to cater for varied dietary preferences and requirements. Our settings i…
Distance Preservation Games
Haris Aziz, Hau Chan, Patrick Lederer +2
We introduce and analyze distance preservation games (DPGs). In DPGs, agents express ideal distances to other agents and need to choose locations in the unit interval while preserv…
Maximum Welfare Allocations under Quantile Valuations
Haris Aziz, Shivika Narang, Mashbat Suzuki
We propose a new model for aggregating preferences over a set of indivisible items based on a quantile value. In this model, each agent is endowed with a specific quantile, and the…
Strategyproof Matching of Roommates and Rooms
Hadi Hosseini, Shivika Narang, Sanjukta Roy
We initiate the study of matching roommates and rooms wherein the preferences of agents over other agents and rooms are complementary and represented by Leontief utilities. In this…
Capacity Modification in the Stable Matching Problem
Salil Gokhale, Shivika Narang, Samarth Singla +1
We study the problem of capacity modification in the many-to-one stable matching of workers and firms. Our goal is to systematically study how the set of stable matchings changes w…
Fair Distribution of Delivery Orders
Hadi Hosseini, Shivika Narang, Tomasz Wąs
We initiate the study of fair distribution of delivery tasks among a set of agents wherein delivery jobs are placed along the vertices of a graph. Our goal is to fairly distribute…
Repeatedly Matching Items to Agents Fairly and Efficiently
Ioannis Caragiannis, Shivika Narang
We consider a novel setting where a set of items are matched to the same set of agents repeatedly over multiple rounds. Each agent gets exactly one item per round, which brings int…
Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations
Siddharth Barman, Anand Krishna, Pooja Kulkarni +1
We study the problem of allocating indivisible goods among agents with the objective of maximizing Nash social welfare (NSW). This welfare function is defined as the geometric…
On Achieving Leximin Fairness and Stability in Many-to-One Matchings
Shivika Narang, Arpita Biswas, Y Narahari
The past few years have seen a surge of work on fairness in allocation problems where items must be fairly divided among agents having individual preferences. In comparison, fairne…
Design of Trusted Market Platforms using Permissioned Blockchains and Game Theory
Shivika Narang
The blockchain concept forms the backbone of a new wave technology that promises to be deployed extensively in a wide variety of industrial and societal applications. Governments,…
On the Coexistence of Stability and Incentive Compatibility in Fractional Matchings
Shivika Narang, Y Narahari
Stable matchings have been studied extensively in social choice literature. The focus has been mostly on integral matchings, in which the nodes on the two sides are wholly matched.…
Fair Division of Indivisible Goods Among Strategic Agents
Siddharth Barman, Ganesh Ghalme, Shweta Jain +2
We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivis…