Approximation algorithm and mechanism design for bisubmodular welfare maximization problem

In a combinatorial auction, m indivisible items are sold to multiple buyers. This paper explores the welfare maximization problem in combinatorial auctions with bisubmodular buyers. When buyers' valuations are public, we give a simple greedy algorithm that outputs an allocation achieving 2-appr...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 1046; p. 115302
Main Authors: Wang, Yuanyuan, Nong, Qingqin, Liu, Wenjing, Fang, Qizhi
Format: Journal Article
Language:English
Published: Elsevier B.V 28.08.2025
Subjects:
Approximation algorithm
Bisubmodular
Combinatorial auction
Mechanism
Welfare maximization
Combinatorial auction
Welfare maximization
Bisubmodular
Approximation algorithm
Mechanism
ISSN:0304-3975
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a combinatorial auction, m indivisible items are sold to multiple buyers. This paper explores the welfare maximization problem in combinatorial auctions with bisubmodular buyers. When buyers' valuations are public, we give a simple greedy algorithm that outputs an allocation achieving 2-approximation, and we prove a hardness result for the bisubmodular welfare maximization problem. When buyers are strategic individuals with valuations as private information, we give a dominant-strategy incentive compatible (DSIC) mechanism that can motivate buyers to provide truthful information and outputs an allocation achieving O(m)-approximation.
ISSN:0304-3975
DOI:10.1016/j.tcs.2025.115302