activity
20092026
most citedSingle Parameter Combinatorial Auctions with Partially Public Valuations

8 citations · 18 across the 6 of their papers we have counts for

collaborators

6 papers

cs.SE2026★ 1 cited

The Llama 4 Herd: Architecture, Training, Evaluation, and Deployment Notes

Redacted by arXiv

This document consolidates publicly reported technical details about Metas Llama 4 model family. It summarizes (i) released variants (Scout and Maverick) and the broader herd conte…

cs.GT2010★ 8 cited

Single Parameter Combinatorial Auctions with Partially Public Valuations

Gagan Goel, Chinmay Karande, Lei Wang

We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions where…

cs.DS2010★ 2 cited

Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations

Gagan Aggarwal, Gagan Goel, Chinmay Karande +1

We study the following vertex-weighted online bipartite matching problem: is a bipartite graph. The vertices in have weights and are known ahead of time, while the…

cs.GT2010★ 3 cited

Market Equilibrium with Transaction Costs

Sourav Chakraborty, Nikhil Devanur, Chinmay Karande

Identical products being sold at different prices in different locations is a common phenomenon. Price differences might occur due to various reasons such as shipping costs, trade…

cs.GT2009★ 4 cited

The Effect of Malice on the Social Optimum in Linear Load Balancing Games

Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan

In this note we consider the following problem to study the effect of malicious players on the social optimum in load balancing games: Consider two players SOC and MAL controlling…

cs.CC2009

Polynomially Correlated Knapsack is NP-complete

Chinmay Karande

0-1 Knapsack is a fundamental NP-complete problem. In this article we prove that it remains NP-complete even when the weights of the objects in the packing constraints and their va…