Budget-feasible procurement has been a major paradigm in mechanism desig...
The vertex cover problem is a fundamental and widely studied combinatori...
We consider budget feasible mechanisms for procurement auctions with add...
We study the use of machine learning techniques to solve a fundamental
s...
Corruption in auctions is a phenomenon that is theoretically still poorl...
Packing problems constitute an important class of optimization problems,...
We consider clustering games in which the players are embedded in a netw...
We study mechanism design for combinatorial cost sharing. Imagine that
m...
The framework of budget-feasible mechanism design studies procurement
au...
We introduce a novel framework to model limited lookahead in congestion
...