research
∙
07/14/2023
Partial Allocations in Budget-Feasible Mechanism Design: Bridging Multiple Levels of Service and Divisible Agents
Budget-feasible procurement has been a major paradigm in mechanism desig...
share
research
∙
11/03/2022
A Round and Bipartize Approximation Algorithm for Vertex Cover
The vertex cover problem is a fundamental and widely studied combinatori...
research
∙
06/27/2022
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents
We consider budget feasible mechanisms for procurement auctions with add...
research
∙
12/22/2021
Using Machine Learning Predictions to Speed-up Dijkstra's Shortest Path Algorithm
We study the use of machine learning techniques to solve a fundamental s...
research
∙
06/03/2021
Capturing Corruption with Hybrid Auctions: Social Welfare Loss in Multi-Unit Auctions
Corruption in auctions is a phenomenon that is theoretically still poorl...
research
∙
12/08/2020
Maximum Coverage with Cluster Constraints: An LP-Based Approximation Technique
Packing problems constitute an important class of optimization problems,...
research
∙
11/19/2020
Topological Price of Anarchy Bounds for Clustering Games on Networks
We consider clustering games in which the players are embedded in a netw...
research
∙
10/14/2019
Cost Sharing over Combinatorial Domains: Complement-Free Cost Functions and Beyond
We study mechanism design for combinatorial cost sharing. Imagine that m...
research
∙
05/02/2019
Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online
The framework of budget-feasible mechanism design studies procurement au...
research
∙
04/19/2018
