中文
相关论文

相关论文: Stochastic Coupon Probing in Social Networks

200 篇论文

This paper considers incentives to provide goods that are partially shareable along social links. We introduce a model in which each individual in a social network not only decides how much of a shareable good to provide, but also decides…

理论经济学 · 经济学 2023-06-05 Stefanie Gerke , Gregory Gutin , Sung-Ha Hwang , Philip Neary

How can a system designer exploit system-level knowledge to derive incentives to optimally influence social behavior? The literature on network routing contains many results studying the application of monetary tolls to influence behavior…

计算机科学与博弈论 · 计算机科学 2019-07-25 Bryce L. Ferguson , Philip N. Brown , Jason R. Marden

For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization…

社会与信息网络 · 计算机科学 2016-07-05 Guangmo Tong , Weili Wu , Shaojie Tang , Ding-Zhu Du

Social networks are getting closer to our real physical world. People share the exact location and time of their check-ins and are influenced by their friends. Modeling the spatio-temporal behavior of users in social networks is of great…

社会与信息网络 · 计算机科学 2017-04-11 Ali Zarezade , Sina Jafarzadeh , Hamid R. Rabiee

This paper considers a problem where multiple users make repeated decisions based on their own observed events. The events and decisions at each time step determine the values of a utility function and a collection of penalty functions. The…

最优化与控制 · 数学 2013-05-13 Michael J. Neely

Learning constraint networks is known to require a number of membership queries exponential in the number of variables. In this paper, we learn constraint networks by asking the user partial queries. That is, we ask the user to classify…

Most studies on influence maximization focus on one-shot propagation, i.e. the influence is propagated from seed users only once following a probabilistic diffusion model and users' activation are determined via single cascade. In reality…

社会与信息网络 · 计算机科学 2017-02-21 Xiaohan Shan , Wei Chen , Qiang Li , Xiaoming Sun , Jialin Zhang

We consider a two-sample hypothesis testing problem, where the distributions are defined on the space of undirected graphs, and one has access to only one observation from each model. A motivating example for this problem is comparing the…

This contribution examines optimization problems that involve stochastic dominance constraints. These problems have uncountably many constraints. We develop methods to solve the optimization problem by reducing the constraints to a finite…

最优化与控制 · 数学 2025-02-27 Rajmadan Lakshmanan , Alois Pichler , Miloš Kopa

Many interventions, such as vaccines in clinical trials or coupons in online marketplaces, must be assigned sequentially without full knowledge of their effects. Multi-armed bandit algorithms have proven successful in such settings.…

机器学习 · 统计学 2026-05-07 Aidan Gleich , Eric Laber , Alexander Volfovsky

In this paper, we address the important issue of uncertainty in the edge influence probability estimates for the well studied influence maximization problem --- the task of finding $k$ seed nodes in a social network to maximize the…

社会与信息网络 · 计算机科学 2016-06-14 Wei Chen , Tian Lin , Zihan Tan , Mingfei Zhao , Xuren Zhou

Most previous work on influence maximization in social networks is limited to the non-adaptive setting in which the marketer is supposed to select all of the seed users, to give free samples or discounts to, up front. A disadvantage of this…

社会与信息网络 · 计算机科学 2016-04-28 Sharan Vaswani , Laks V. S. Lakshmanan

We study a model of collective real-time decision-making (or learning) in a social network operating in an uncertain environment, for which no a priori probabilistic model is available. Instead, the environment's impact on the agents in the…

最优化与控制 · 数学 2015-01-30 Maxim Raginsky , Angelia Nedić

We are interested in assigning a pre-specified number of nodes as leaders in order to minimize the mean-square deviation from consensus in stochastically forced networks. This problem arises in several applications including control of…

最优化与控制 · 数学 2014-12-11 Fu Lin , Makan Fardad , Mihailo R. Jovanović

We study the stochastic multi-armed bandit (MAB) problem in the presence of side-observations across actions that occur as a result of an underlying network structure. In our model, a bipartite graph captures the relationship between…

机器学习 · 计算机科学 2017-07-14 Swapna Buccapatnam , Fang Liu , Atilla Eryilmaz , Ness B. Shroff

In a crowdsourcing contest, a principal holding a task posts it to a crowd. People in the crowd then compete with each other to win the rewards. Although in real life, a crowd is usually networked and people influence each other via social…

人工智能 · 计算机科学 2022-11-23 Qi Shi , Dong Hao

A central server needs to perform statistical inference based on samples that are distributed over multiple users who can each send a message of limited length to the center. We study problems of distribution learning and identity testing…

数据结构与算法 · 计算机科学 2020-10-02 Jayadev Acharya , Clément L. Canonne , Himanshu Tyagi

This paper considers stochastic bandits with side observations, a model that accounts for both the exploration/exploitation dilemma and relationships between arms. In this setting, after pulling an arm i, the decision maker also observes…

机器学习 · 计算机科学 2012-10-19 Stephane Caron , Branislav Kveton , Marc Lelarge , Smriti Bhagat

This paper surveys mathematical models, structural results and algorithms in controlled sensing with social learning in social networks. Part 1, namely Bayesian Social Learning with Controlled Sensing addresses the following questions: How…

信号处理 · 电气工程与系统科学 2022-12-29 Vikram Krishnamurthy

In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not…

数据结构与算法 · 计算机科学 2017-02-24 Yi Huang , Mano Vikash Janardhanan , Lev Reyzin