Zobrazeno 1 - 10
of 80
pro vyhledávání: '"Truong, Van‐Anh"'
Publikováno v:
Journal of Product & Brand Management, 2024, Vol. 33, Issue 2, pp. 258-272.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JPBM-05-2023-4476
Autor:
Yang, Shuoguang, Truong, Van-Anh
We propose a detailed analysis of the online-learning problem for Independent Cascade (IC) models under node-level feedback. These models have widespread applications in modern social networks. Existing works for IC models have only shed light on edg
Externí odkaz:
http://arxiv.org/abs/2109.02519
We propose a cumulative oversampling (CO) method for online learning. Our key idea is to sample parameter estimations from the updated belief space once in each round (similar to Thompson Sampling), and utilize the cumulative samples up to the curren
Externí odkaz:
http://arxiv.org/abs/2004.11963
Problem definition: Corporate brands, grassroots activists, and ordinary citizens all routinely employ Word-of-mouth (WoM) diffusion to promote products and instigate social change. Our work models the formation and spread of negative attitudes via W
Externí odkaz:
http://arxiv.org/abs/1911.03276
We consider a brand with a given budget that wants to promote a product over multiple rounds of influencer marketing. In each round, it commissions an influencer to promote the product over a social network, and then observes the subsequent diffusion
Externí odkaz:
http://arxiv.org/abs/1911.02986
Autor:
Truong, Van-Anh, Wang, Xinshang
The classical Prophet Inequality arises from a fundamental problem in optimal-stopping theory. In this problem, a gambler sees a finite sequence of independent, non-negative random variables. If he stops the sequence at any time, he collects a reward
Externí odkaz:
http://arxiv.org/abs/1901.02552
We study web and mobile applications that are used to schedule advance service, from medical appointments to restaurant reservations. We model them as online weighted bipartite matching problems with non-stationary arrivals. We propose new algorithms
Externí odkaz:
http://arxiv.org/abs/1805.10412
We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic processes. Ea
Externí odkaz:
http://arxiv.org/abs/1805.05554
Publikováno v:
In Appetite 1 January 2022 168
Publikováno v:
In Appetite 1 June 2021 161