1 citations · 1 across the 8 of their papers we have counts for
4 papers · 1 filter
Witness Set in Weak Visibility Polygons is Polynomial-Time Solvable
Udvas Das, Shouvik Mondal, Sasanka Roy
In the classical Art Gallery Problem (AGP), guards are placed in a polygon so that together they see every point. The Witness Set Problem (WSP), introduced by Amit, Mitchell, and P…
Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons
Shouvik Mondal, Udvas Das, Sasanka Roy
The Art Gallery Problem (AGP) asks for the fewest guards that see all of a simple polygon. It is -complete, hence NP-hard. We show that for a particular class of…
Simulating Eutopia: Revisiting Long-term Fairness with Outcomes, Performativity, and Dynamics
Vedant Palit, Udvas Das, Brahim Driss +1
As AI-driven Decision Makers (ADMs) influence our socioeconomic reality, their roles in both enhancing efficiency and amplifying the social biases have drawn significant attention.…
Bandits for Efficient Experimentation: Adapting to Control Group, Preferences, and Context Drifts
Udvas Das, Waris Radji, Debabrota Basu +1
We consider a variant of the linear contextual stochastic multi-armed bandits, where the learner must provide recommendations to a group of users, each having its personalized pref…