Matches in SemOpenAlex for { <https://semopenalex.org/work/W4301795912> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W4301795912 abstract "We consider the revenue maximization problem with sharp multi-demand, in which $m$ indivisible items have to be sold to $n$ potential buyers. Each buyer $i$ is interested in getting exactly $d_i$ items, and each item $j$ gives a benefit $v_{ij}$ to buyer $i$. We distinguish between unrelated and related valuations. In the former case, the benefit $v_{ij}$ is completely arbitrary, while, in the latter, each item $j$ has a quality $q_j$, each buyer $i$ has a value $v_i$ and the benefit $v_{ij}$ is defined as the product $v_i q_j$. The problem asks to determine a price for each item and an allocation of bundles of items to buyers with the aim of maximizing the total revenue, that is, the sum of the prices of all the sold items. The allocation must be envy-free, that is, each buyer must be happy with her assigned bundle and cannot improve her utility. We first prove that, for related valuations, the problem cannot be approximated to a factor $O(m^{1-epsilon})$, for any $epsilon>0$, unless {sf P} = {sf NP} and that such result is asymptotically tight. In fact we provide a simple $m$-approximation algorithm even for unrelated valuations. We then focus on an interesting subclass of proper instances, that do not contain buyers a priori known not being able to receive any item. For such instances, we design an interesting $2$-approximation algorithm and show that no $(2-epsilon)$-approximation is possible for any $0<epsilonleq 1$, unless {sf P} $=$ {sf NP}. We observe that it is possible to efficiently check if an instance is proper, and if discarding useless buyers is allowed, an instance can be made proper in polynomial time, without worsening the value of its optimal solution." @default.
- W4301795912 created "2022-10-05" @default.
- W4301795912 creator A5021894709 @default.
- W4301795912 creator A5027632307 @default.
- W4301795912 creator A5051227299 @default.
- W4301795912 date "2013-12-13" @default.
- W4301795912 modified "2023-09-26" @default.
- W4301795912 title "Approximating the Revenue Maximization Problem with Sharp Demands" @default.
- W4301795912 doi "https://doi.org/10.48550/arxiv.1312.3892" @default.
- W4301795912 hasPublicationYear "2013" @default.
- W4301795912 type Work @default.
- W4301795912 citedByCount "0" @default.
- W4301795912 crossrefType "posted-content" @default.
- W4301795912 hasAuthorship W4301795912A5021894709 @default.
- W4301795912 hasAuthorship W4301795912A5027632307 @default.
- W4301795912 hasAuthorship W4301795912A5051227299 @default.
- W4301795912 hasBestOaLocation W43017959121 @default.
- W4301795912 hasConcept C105795698 @default.
- W4301795912 hasConcept C111472728 @default.
- W4301795912 hasConcept C114614502 @default.
- W4301795912 hasConcept C121332964 @default.
- W4301795912 hasConcept C121955636 @default.
- W4301795912 hasConcept C126255220 @default.
- W4301795912 hasConcept C138885662 @default.
- W4301795912 hasConcept C144237770 @default.
- W4301795912 hasConcept C159985019 @default.
- W4301795912 hasConcept C162324750 @default.
- W4301795912 hasConcept C192562407 @default.
- W4301795912 hasConcept C195487862 @default.
- W4301795912 hasConcept C2524010 @default.
- W4301795912 hasConcept C2776291640 @default.
- W4301795912 hasConcept C2776330181 @default.
- W4301795912 hasConcept C2778134712 @default.
- W4301795912 hasConcept C2779530757 @default.
- W4301795912 hasConcept C2780586882 @default.
- W4301795912 hasConcept C33923547 @default.
- W4301795912 hasConcept C41008148 @default.
- W4301795912 hasConcept C62520636 @default.
- W4301795912 hasConcept C75553542 @default.
- W4301795912 hasConcept C90673727 @default.
- W4301795912 hasConceptScore W4301795912C105795698 @default.
- W4301795912 hasConceptScore W4301795912C111472728 @default.
- W4301795912 hasConceptScore W4301795912C114614502 @default.
- W4301795912 hasConceptScore W4301795912C121332964 @default.
- W4301795912 hasConceptScore W4301795912C121955636 @default.
- W4301795912 hasConceptScore W4301795912C126255220 @default.
- W4301795912 hasConceptScore W4301795912C138885662 @default.
- W4301795912 hasConceptScore W4301795912C144237770 @default.
- W4301795912 hasConceptScore W4301795912C159985019 @default.
- W4301795912 hasConceptScore W4301795912C162324750 @default.
- W4301795912 hasConceptScore W4301795912C192562407 @default.
- W4301795912 hasConceptScore W4301795912C195487862 @default.
- W4301795912 hasConceptScore W4301795912C2524010 @default.
- W4301795912 hasConceptScore W4301795912C2776291640 @default.
- W4301795912 hasConceptScore W4301795912C2776330181 @default.
- W4301795912 hasConceptScore W4301795912C2778134712 @default.
- W4301795912 hasConceptScore W4301795912C2779530757 @default.
- W4301795912 hasConceptScore W4301795912C2780586882 @default.
- W4301795912 hasConceptScore W4301795912C33923547 @default.
- W4301795912 hasConceptScore W4301795912C41008148 @default.
- W4301795912 hasConceptScore W4301795912C62520636 @default.
- W4301795912 hasConceptScore W4301795912C75553542 @default.
- W4301795912 hasConceptScore W4301795912C90673727 @default.
- W4301795912 hasLocation W43017959121 @default.
- W4301795912 hasOpenAccess W4301795912 @default.
- W4301795912 hasPrimaryLocation W43017959121 @default.
- W4301795912 hasRelatedWork W1887191277 @default.
- W4301795912 hasRelatedWork W1978042415 @default.
- W4301795912 hasRelatedWork W2017331178 @default.
- W4301795912 hasRelatedWork W2083645236 @default.
- W4301795912 hasRelatedWork W2536000384 @default.
- W4301795912 hasRelatedWork W2904399427 @default.
- W4301795912 hasRelatedWork W2972655396 @default.
- W4301795912 hasRelatedWork W3048361030 @default.
- W4301795912 hasRelatedWork W3086542228 @default.
- W4301795912 hasRelatedWork W3189430615 @default.
- W4301795912 isParatext "false" @default.
- W4301795912 isRetracted "false" @default.
- W4301795912 workType "article" @default.