5 citations · 14 across the 14 of their papers we have counts for
15 papers
Fair Allocation with Dichotomous Preferences over Item Complements
Soumyajit Pyne, Vignesh Viswanathan, Wenhao Yang +1
We study the problem of fair allocation when agents have dichotomous submodular preferences over groups of, rather than individual, items. These preferences naturally extend existi…
Stable Matching under Matroid Rank Valuations
Alon Eden, Vignesh Viswanathan, Yair Zick
We study a two-sided matching model where one side of the market (hospitals) has combinatorial preferences over the other side (doctors). Specifically, we consider the setting wher…
Towards Optimal Multi-draft Speculative Decoding
Zhengmian Hu, Tong Zheng, Vignesh Viswanathan +5
Large Language Models (LLMs) have become an indispensable part of natural language processing tasks. However, autoregressive sampling has become an efficiency bottleneck. Multi-Dra…
On the Hardness of Fair Allocation under Ternary Valuations
Zack Fitzsimmons, Vignesh Viswanathan, Yair Zick
We study the problem of fair allocation of indivisible items when agents have ternary additive valuations -- each agent values each item at some fixed integer values , , or $…
Axiomatic Aggregations of Abductive Explanations
Gagan Biradar, Yacine Izza, Elita Lobo +2
The recent criticisms of the robustness of post hoc model approximation explanation methods (like LIME and SHAP) have led to the rise of model-precise abductive explanations. For e…
The Good, the Bad and the Submodular: Fairly Allocating Mixed Manna Under Order-Neutral Submodular Preferences
Cyrus Cousins, Vignesh Viswanathan, Yair Zick
We study the problem of fairly allocating indivisible goods (positively valued items) and chores (negatively valued items) among agents with decreasing marginal utilities over item…
Tight Approximations for Graphical House Allocation
Hadi Hosseini, Andrew McGregor, Rik Sengupta +2
The Graphical House Allocation problem asks: how can houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph , so as to minimize the…
Simple Steps to Success: A Method for Step-Based Counterfactual Explanations
Jenny Hamer, Nicholas Perello, Jake Valladares +2
Algorithmic recourse is a process that leverages counterfactual explanations, going beyond understanding why a system produced a given classification, to providing a user with acti…
Weighted Notions of Fairness with Binary Supermodular Chores
Vignesh Viswanathan, Yair Zick
We study the problem of allocating indivisible chores among agents with binary supermodular cost functions. In other words, each chore has a marginal cost of or and chores…
Dividing Good and Better Items Among Agents with Bivalued Submodular Valuations
Cyrus Cousins, Vignesh Viswanathan, Yair Zick
We study the problem of fairly allocating a set of indivisible goods among agents with {\em bivalued submodular valuations} -- each good provides a marginal gain of either or $…
Learning Effective Strategies for Moving Target Defense with Switching Costs
Vignesh Viswanathan, Megha Bose, Praveen Paruchuri
Moving Target Defense (MTD) has emerged as a key technique in various security applications as it takes away the attacker's ability to perform reconnaissance for exploiting a syste…
Graphical House Allocation
Hadi Hosseini, Justin Payan, Rik Sengupta +2
The classical house allocation problem involves assigning houses (or items) to agents according to their preferences. A key criterion in such problems is satisfying some fa…
A General Framework for Fair Allocation under Matroid Rank Valuations
Vignesh Viswanathan, Yair Zick
We study the problem of fairly allocating a set of indivisible goods among agents with matroid rank valuations -- every good provides a marginal value of or when added to a…
Yankee Swap: a Fast and Simple Fair Allocation Mechanism for Matroid Rank Valuations
Vignesh Viswanathan, Yair Zick
We study fair allocation of indivisible goods when agents have matroid rank valuations. Our main contribution is a simple algorithm based on the colloquial Yankee Swap procedure th…
Relaxations of Envy-Freeness Over Graphs
Justin Payan, Rik Sengupta, Vignesh Viswanathan
When allocating a set of indivisible items among agents, the ideal condition of envy-freeness cannot always be achieved. Envy-freeness up to any good (EFX), and envy-freeness with…