129 citations · 605 across the 54 of their papers we have counts for
66 papers
Water-Filling is Universally Minimax Optimal
Siddhartha Banerjee, Ramiro N. Deo-Campo Vuong, Robert Kleinberg
Allocation of dynamically-arriving (i.e., online) divisible resources among a set of offline agents is a fundamental problem, with applications to online marketplaces, scheduling,…
S-MARC: Causal Streaming Reasoning for Full-Duplex Conversational Behavior Modeling
Dingkun Zhou, Shuchang Pan, Jiachen Lian +11
Human conversation is organized by an implicit chain of thought and manifests as temporally structured conversational behaviors. Capturing this perceptual pathway is critical for b…
Enabling Conversational Behavior Reasoning Capabilities in Full-Duplex Speech
Shuchang Pan, Siddharth Banerjee, Dhruv Hebbar +9
Human conversation is organized by an implicit chain of thoughts that manifests as timed speech acts. Capturing this causal pathway is key to building natural full-duplex interacti…
Robust Resource Allocation via Competitive Subsidies
David X. Lin, Giannis Fikioris, Siddhartha Banerjee +1
A canonical setting for non-monetary online resource allocation is one where agents compete over multiple rounds for a single item per round, with i.i.d. valuations and additive ut…
Dynamic Allocation of Public Goods with Approximate Core Equilibria
Chido Onyeze, David X. Lin, Siddhartha Banerjee +1
We consider the problem of repeatedly allocating multiple shareable public goods that have limited availability in an online setting without the use of money. In our setting, agent…
Sequential Fair Allocation With Replenishments: A Little Envy Goes An Exponentially Long Way
Chido Onyeze, Sean R. Sinclair, Chamsi Hssaine +1
We study the trade-off between envy and inefficiency in repeated resource allocation settings with stochastic replenishments, motivated by real-world systems such as food banks and…
Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
David X. Lin, Daniel Hall, Giannis Fikioris +2
We study the problem of fair online resource allocation via non-monetary mechanisms, where multiple agents repeatedly share a resource without monetary transfers. Previous work has…
Robust Equilibria in Shared Resource Allocation via Strengthening Border's Theorem
David X. Lin, Siddhartha Banerjee, Giannis Fikioris +1
We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that e…
The Price of Competitive Information Disclosure
Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen +1
In many decision-making scenarios, individuals strategically choose what information to disclose to optimize their own outcomes. It is unclear whether such strategic information di…
Allocating Public Goods via Dynamic Max-Min Fairness: Long-Run Behavior and Competitive Equilibria
Chido Onyeze, Siddhartha Banerjee, Giannis Fikioris +1
Dynamic max-min fair allocation (DMMF) is a simple and popular mechanism for the repeated allocation of a shared resource among competing agents: in each round, each agent can choo…
Majorized Bayesian Persuasion and Fair Selection
Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen +1
We address the fundamental problem of selection under uncertainty by modeling it from the perspective of Bayesian persuasion. In our model, a decision maker with imperfect informat…
Price Competition Under Platform-Mediated Search: A Consider-Then-Choose Framework
Siddhartha Banerjee, Chamsi Hssaine, Vijay Kamble
We study the problem of predicting price equilibria on e-commerce platforms where sellers compete across multiple attributes (e.g., price, average rating, delivery speed). In these…
Online Fair Allocation of Perishable Resources
Siddhartha Banerjee, Chamsi Hssaine, Sean R. Sinclair
We consider a practically motivated variant of the canonical online fair allocation problem: a decision-maker has a budget of perishable resources to allocate over a fixed number o…
The SMART approach to instance-optimal online learning
Siddhartha Banerjee, Alankrita Bhatt, Christina Lee Yu
We devise an online learning algorithm -- titled Switching via Monotone Adapted Regret Traces (SMART) -- that adapts to the data and achieves regret that is instance optimal, i.e.,…
Hot Electron Generation and Manipulation in Nano-spiked Plasmonic Cavity Arrays
Siddhartha Banerjee, Jolly Xavier
The generation of the localized surface plasmon resonance (LSPR) on the surface of plasmonic structures in the nanoscale has paved the way for advanced biosensing, surpassing the c…
Beyond Worst-Case Online Allocation via Dynamic Max-min Fairness
Giannis Fikioris, Siddhartha Banerjee, Éva Tardos
We study the allocation of shared resources over multiple rounds among competing agents, via the dynamic max-min fair (DMMF) mechanism: the good in each round is allocated to the r…
Fair Price Discrimination
Siddhartha Banerjee, Kamesh Munagala, Yiheng Shen +1
A seller is pricing identical copies of a good to a stream of unit-demand buyers. Each buyer has a value on the good as his private information. The seller only knows the empirical…
Robust Pseudo-Markets for Reusable Public Resources
Siddhartha Banerjee, Giannis Fikioris, Éva Tardos
We study non-monetary mechanisms for the fair and efficient allocation of reusable public resources, i.e., resources used for varying durations. We consider settings where a limite…
Graph Searching with Predictions
Siddhartha Banerjee, Vincent Cohen-Addad, Anupam Gupta +1
Consider an agent exploring an unknown graph in search of some goal state. As it walks around the graph, it learns the nodes and their neighbors. The agent only knows where the goa…
Online Team Formation under Different Synergies
Matthew Eichhorn, Siddhartha Banerjee, David Kempe
Team formation is ubiquitous in many sectors: education, labor markets, sports, etc. A team's success depends on its members' latent types, which are not directly observable but ca…
Artificial Replay: A Meta-Algorithm for Harnessing Historical Data in Bandits
Siddhartha Banerjee, Sean R. Sinclair, Milind Tambe +2
Most real-world deployments of bandit algorithms exist somewhere in between the offline and online set-up, where some historical data is available upfront and additional data is co…
Proportionally Fair Online Allocation of Public Goods with Predictions
Siddhartha Banerjee, Vasilis Gkatzelis, Safwan Hossain +3
We design online algorithms for the fair allocation of public goods to a set of agents over a sequence of rounds and focus on improving their performance using predictions.…
Dynamic Interventions for Networked Contagions
Marios Papachristou, Siddhartha Banerjee, Jon Kleinberg
We study the problem of designing dynamic intervention policies for minimizing networked defaults in financial networks. Formally, we consider a dynamic version of the celebrated E…
Allocating with Priorities and Quotas: Algorithms, Complexity, and Dynamics
Siddhartha Banerjee, Matthew Eichhorn, David Kempe
In many applications such as rationing medical care and supplies, university admissions, and the assignment of public housing, the decision of who receives an allocation can be jus…