A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Near-optimal asymmetric binary matrix partitions
[article]
2015
arXiv
pre-print
We study the asymmetric binary matrix partition problem that was recently introduced by Alon et al. (WINE 2013) to model the impact of asymmetric information on the revenue of the seller in take-it-or-leave-it sales. Instances of the problem consist of an n × m binary matrix A and a probability distribution over its columns. A partition scheme B=(B_1,...,B_n) consists of a partition B_i for each row i of A. The partition B_i acts as a smoothing operator on row i that distributes the expected
arXiv:1407.8170v3
fatcat:tr5jcdbmwvdcvhn7wyvxgxn7ri