Research Repository

Near-Optimal Asymmetric Binary Matrix Partitions

Abed, Fidaa and Caragiannis, Ioannis and Voudouris, Alexandros A (2018) 'Near-Optimal Asymmetric Binary Matrix Partitions.' Algorithmica, 80 (1). 48 - 72. ISSN 0178-4617

[img]
Preview
Text
abmp.algo.2018.pdf - Accepted Version

Download (500kB) | Preview

Abstract

We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (Proceedings of the 9th Conference on Web and Internet Economics (WINE), pp 1–14, 2013). Instances of the problem consist of an n× m binary matrix A and a probability distribution over its columns. A partition schemeB= (B1, … , Bn) consists of a partition Bifor each row i of A. The partition Biacts as a smoothing operator on row i that distributes the expected value of each partition subset proportionally to all its entries. Given a scheme B that induces a smooth matrix AB, the partition value is the expected maximum column entry of AB. The objective is to find a partition scheme such that the resulting partition value is maximized. We present a 9/10-approximation algorithm for the case where the probability distribution is uniform and a (1 - 1 / e) -approximation algorithm for non-uniform distributions, significantly improving results of Alon et al. Although our first algorithm is combinatorial (and very simple), the analysis is based on linear programming and duality arguments. In our second result we exploit a nice relation of the problem to submodular welfare maximization.

Item Type: Article
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Elements
Date Deposited: 20 May 2020 11:58
Last Modified: 20 May 2020 12:15
URI: http://repository.essex.ac.uk/id/eprint/27261

Actions (login required)

View Item View Item