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 cs.GTShow all

25 papers · 1 filter

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…

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…

cs.GT2024

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…

cs.GT2024

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…

cs.GT2023

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…

cs.GT2023

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…

cs.GT2023★ 4 cited

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…

cs.GT2022★ 2 cited

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…

cs.GT2022★ 1 cited

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.…

cs.GT2022

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…

cs.GT2021

Threshold Tests as Quality Signals: Optimal Strategies, Equilibria, and Price of Anarchy

Siddhartha Banerjee, David Kempe, Robert Kleinberg

We study a signaling game between two firms competing to have their product chosen by a principal. The products have qualities drawn i.i.d. from a common prior. The principal aims…

cs.GT2021★ 2 cited

Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Tradeoff Curve

Sean R. Sinclair, Gauri Jain, Siddhartha Banerjee +1

We consider the problem of dividing limited resources to individuals arriving over rounds. Each round has a random number of individuals arrive, and individuals can be characte…

cs.GT2020★ 3 cited

Sequential Fair Allocation of Limited Resources under Stochastic Demands

Sean R. Sinclair, Gauri Jain, Siddhartha Banerjee +1

We consider the problem of dividing limited resources between a set of agents arriving sequentially with unknown (stochastic) utilities. Our goal is to find a fair allocation - one…

cs.GT2020★ 1 cited

The Limits of an Information Intermediary in Auction Design

Reza Alijani, Siddhartha Banerjee, Kamesh Munagala +1

We study the limits of an information intermediary in the classical Bayesian auction, where a revenue-maximizing seller sells one item to buyers with independent private values…

cs.GT2020★ 10 cited

Online Nash Social Welfare Maximization with Predictions

Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh +1

We consider the problem of allocating a set of divisible goods to agents in an online manner, aiming to maximize the Nash social welfare, a widely studied objective which provi…

cs.GT2020★ 2 cited

Predict and Match: Prophet Inequalities with Uncertain Supply

Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi +2

We consider the problem of selling perishable items to a stream of buyers in order to maximize social welfare. A seller starts with a set of identical items, and each arriving buye…

cs.GT2018★ 2 cited

Information Signal Design for Incentivizing Team Formation

Chamsi Hssaine, Siddhartha Banerjee

We study the use of Bayesian persuasion (i.e., strategic use of information disclosure/signaling) in endogenous team formation. This is an important consideration in settings such…

cs.GT2017★ 3 cited

Two-sided Facility Location

Reza Alijani, Siddhartha Banerjee, Sreenivas Gollapudi +2

Recent years have witnessed the rise of many successful e-commerce marketplace platforms like the Amazon marketplace, AirBnB, Uber/Lyft, and Upwork, where a central platform mediat…

cs.GT2016★ 3 cited

Re-incentivizing Discovery: Mechanisms for Partial-Progress Sharing in Research

Anilesh Kollagunta Krishnaswamy, Ashish Goel, Siddhartha Banerjee

An essential primitive for an efficient research ecosystem is \emph{partial-progress sharing} (PPS) -- whereby a researcher shares information immediately upon making a breakthroug…

cs.GT2016

Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework

Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris

Optimizing shared vehicle systems (bike/scooter/car/ride-sharing) is more challenging compared to traditional resource allocation settings due to the presence of \emph{complex netw…