Constrained submodular maximization problems encompass a wide variety of applications,
including personalized recommendation, team formation, and revenue maximization via …

We revisit the classical problem of designing Budget-Feasible Mechanisms (BFMs) for
submodular valuation functions, which has been extensively studied since the seminal …

We revisit the well-studied problem of budget-feasible procurement, where a buyer with a
strict budget constraint seeks to acquire services from a group of strategic providers (the …

Submodular maximization is one of the central topics in combinatorial optimization. It has
found numerous applications in the real world. In the past decades, a series of algorithms …

A lot of applications in web economics need to maximize the revenue under a budget for
payments and also guarantee the truthfulness of users, so Budget-Feasible Mechanism …

We design and analyze deterministic and randomized clock auctions for single-parameter
domains with downward-closed feasibility constraints, aiming to maximize the social welfare …

This work, for the first time, introduces two constant factor approximation algorithms with
linear query complexity for non-monotone submodular maximization over a ground set of …

Are subsidies or taxes more effective at influencing user behavior? To answer this question,
we focus on the well-studied framework of atomic congestion games which model resource …

Constrained submodular maximization problems encompass a wide variety of applications,
including personalized recommendation, team formation, and revenue maximization via …

Motivated by many practical applications, in this paper we study budget feasible
mechanisms with the goal of procuring an independent set of a matroid. More specifically …