Discount allocation for cost minimization in online social networks (Q2025108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-020-00674-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3109074688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the Cover: The structure of scientific collaboration networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable influence maximization for independent cascade model in large-scale social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: List edge and list total coloring of planar graphs with maximum degree 8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:04, 25 July 2024

scientific article
Language Label Description Also known as
English
Discount allocation for cost minimization in online social networks
scientific article

    Statements

    Discount allocation for cost minimization in online social networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    This paper studies discount allocation for cost minimization in online social networks. It adopts the online full-feedback setting to the discount allocation problem in the online social networks. A utility function is introduced to influence a certain number of people who use the product with the minimal cost in expectation. Two algorithms in uniform and non-uniform discount situations are presented. In non-uniform discount model, discount is offered to selected users from lowest to highest in the discount rate set until the users become active. The performance of the algorithms are analyzed. The authors also present some numerical computations for the proposed algorithm. The datasets used are an online community interaction network and a scientific collaboration network relevant to co-authorship.
    0 references
    0 references
    discount allocation
    0 references
    seed selection
    0 references
    minimum cost
    0 references
    online social networks
    0 references

    Identifiers