← Search

Darshan Chakrabarti

8 accepted papers

2024

Automated Design of Affine Maximizer Mechanisms in Dynamic Settings

AAAI 2024technical

Dynamic mechanism design is a challenging extension to ordinary mechanism design in which the mechanism designer must make a sequence of decisions over time in the face of possibly untruthful reports of participating agents. Optimizing dynamic mechanisms for welfare is relatively well understood. Ho…

Cited by 9SourcePDFScholar
2024

Efficient Learning in Polyhedral Games via Best-Response Oracles

AAAI 2024technical

We study online learning and equilibrium computation in games with polyhedral decision sets, a property shared by normal-form games (NFGs) and extensive-form games (EFGs), when the learning agent is restricted to utilizing a best-response oracle. We show how to achieve constant regret in zero-sum ga…

Cited by 3SourcePDFScholar
2024

Extensive-Form Game Solving via Blackwell Approachability on Treeplexes

NeurIPS 2024spotlight

We introduce the first algorithmic framework for Blackwell approachability on the sequence-form polytope, the class of convex polytopes capturing the strategies of players in extensive-form games (EFGs). This leads to a new class of regret-minimization algorithms that are stepsize-invariant, in the…

Cited by 0SourcePDFScholar
2024

Implications of Distance over Redistricting Maps: Central and Outlier Maps

AAAI 2024technical

In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative. A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost-equal population. However, these constraints ar…

Cited by 2SourcePDFScholar
2023

Block-Coordinate Methods and Restarting for Solving Extensive-Form Games

NeurIPS 2023poster

Coordinate descent methods are popular in machine learning and optimization for their simple sparse updates and excellent practical performance. In the context of large-scale sequential game solving, these same properties would be attractive, but until now no such methods were known, because the st…

Cited by 7SourcePDFScholar
2022

A New Notion of Individually Fair Clustering: $α$-Equitable $k$-Center

AISTATS 2022poster

Clustering is a fundamental problem in unsupervised machine learning, and due to its numerous societal implications fair variants of it have recently received significant attention. In this work we introduce a novel definition of individual fairness for clustering problems. Specifically, in our mode…

2021

Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints

AAAI 2021technical

Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research. However, in a variety of situations we may have additional requirements or knowledge, distinct from the underlying metric, regarding which pairs of points s…

2020

A Pairwise Fair and Community-preserving Approach to k-Center Clustering

ICML 2020poster

Clustering is a foundational problem in machine learning with numerous applications. As machine learning increases in ubiquity as a backend for automated systems, concerns about fairness arise. Much of the current literature on fairness deals with discrimination against protected classes in supervis…