activity
20112026
most citedMulti-document abstractive summarization using ILP based multi-sentence compression

129 citations · 605 across the 54 of their papers we have counts for

collaborators
Showing 2025Show all

8 papers · 1 filter

cs.CL2025

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…

cs.GT2025

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…

cs.GT2025

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…

math.OC2025

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…

cs.GT2025

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…

cs.GT2025

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…

cs.GT2025

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…

cs.GT2025

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…