English
Related papers

Related papers: The Repeated Solicitation Model

200 papers

Partnering with a large online retailer, we consider the problem of sending daily personalized promotions to a userbase of over 20 million customers. We propose an efficient policy for determining, every day, the promotion that each…

Computer Science and Game Theory · Computer Science 2026-01-01 Jackie Baek , Will Ma , Dmitry Mitrofanov

Poisson factorization is a probabilistic model of users and items for recommendation systems, where the so-called implicit consumer data is modeled by a factorized Poisson distribution. There are many variants of Poisson factorization…

Social and Information Networks · Computer Science 2017-03-07 Seyed Abbas Hosseini , Keivan Alizadeh , Ali Khodadadi , Ali Arabzadeh , Mehrdad Farajtabar , Hongyuan Zha , Hamid R. Rabiee

We consider a polling system: a queueing system of $N\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating…

Probability · Mathematics 2011-11-09 Onno Boxma , Offer Kella , Kamil Marcin Kosinski

Inspired by real-time ad exchanges for online display advertising, we consider the problem of inferring a buyer's value distribution for a good when the buyer is repeatedly interacting with a seller through a posted-price mechanism. We…

Machine Learning · Computer Science 2013-11-28 Kareem Amin , Afshin Rostamizadeh , Umar Syed

Probabilistic modeling is cyclical: we specify a model, infer its posterior, and evaluate its performance. Evaluation drives the cycle, as we revise our model based on how it performs. This requires a metric. Traditionally, predictive…

Machine Learning · Statistics 2016-05-25 Alp Kucukelbir , David M. Blei

The (conditional or unconditional) distribution of the continuous scan statistic in a one-dimensional Poisson process may be approximated by that of a discrete analogue via time discretization (to be referred to as the discrete…

Probability · Mathematics 2016-02-09 Yi-Ching Yao , Daniel Wei-Chung Miao , Xenos Chang-Shuo Lin

In this work we are concerned with the design of efficient mechanisms while eliciting limited information from the agents. First, we study the performance of sampling approximations in facility location games. Our key result is to show that…

Computer Science and Game Theory · Computer Science 2022-08-26 Ioannis Anagnostides , Dimitris Fotakis , Panagiotis Patsilinakos

We analyze a tandem network of polling queues with two product types and two stations. We assume that external arrivals to the network follow a Poisson process, and service times at each station are exponentially distributed. For this…

Performance · Computer Science 2021-05-25 Ravi Suman , Ananth Krishnamurthy

This paper introduces a discrete-time fractional Poisson process defined as a renewal process, where the waiting times follow a discrete Mittag-Leffler distribution. We investigate its fundamental properties by explicitly deriving the…

Probability · Mathematics 2026-05-06 Naohiro Yoshida

Motivated by online display ad exchanges, we study a setting in which an exchange repeatedly interacts with bidders who have quota, making decisions about which subsets of bidders are called to participate in ad-slot-specific auctions. A…

Computer Science and Game Theory · Computer Science 2017-02-08 Hossein Azari , William D. Heavlin , Hoda Heidari , Max Lin , Sonia Todorova

Prediction in a small-sized sample with a large number of covariates, the "small n, large p" problem, is challenging. This setting is encountered in multiple applications, such as precision medicine, where obtaining additional samples can…

Artificial Intelligence · Computer Science 2017-07-14 Pedram Daee , Tomi Peltola , Marta Soare , Samuel Kaski

Situations where a group of agents come together to jointly buy a resource that they individually cannot afford to buy are commonly observed in markets. For example in the US market for radio spectrum, a recent proposal invited small firms…

Computer Science and Game Theory · Computer Science 2015-03-09 Vijay Kamble , Jean Walrand

We study the problem of how to coordinate the actions of independent agents in a distributed system where message arrival times are unbounded, but are determined by an exponential probability distribution. Asynchronous protocols executed in…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-11-10 Ariel Livshits , Yoram Moses

In a delegation problem, a principal P with commitment power tries to pick one out of $n$ options. Each option is drawn independently from a known distribution. Instead of inspecting the options herself, P delegates the information…

Computer Science and Game Theory · Computer Science 2022-03-03 Pirmin Braun , Niklas Hahn , Martin Hoefer , Conrad Schecker

Users can now give back energies to the grid using distributed resources. Proper incentive mechanisms are required for such users, also known as prosumers, in order to maximize the sell-back amount while maintaining the retailer's profit.…

Optimization and Control · Mathematics 2022-03-14 Diptangshu Sen , Arnob Ghosh

Peer prediction mechanisms are often adopted to elicit truthful contributions from crowd workers when no ground-truth verification is available. Recently, mechanisms of this type have been developed to incentivize effort exertion, in…

Computer Science and Game Theory · Computer Science 2016-12-05 Yang Liu , Yiling Chen

Persuasion games are fundamental in economics and AI research and serve as the basis for important applications. However, work on this setup assumes communication with stylized messages that do not consist of rich human language. In this…

Computation and Language · Computer Science 2022-01-03 Maya Raifer , Guy Rotman , Reut Apel , Moshe Tennenholtz , Roi Reichart

We study computational questions in a game-theoretic model that, in particular, aims to capture advertising/persuasion applications such as viral marketing. Specifically, we consider a multi-agent Bayesian persuasion model where an informed…

Computer Science and Game Theory · Computer Science 2016-03-07 Yakov Babichenko , Siddharth Barman

A monopolistic seller aims to sell an indivisible item to multiple potential buyers. Each buyer's valuation depends on their private type and the item's quality. The seller can observe the quality but it is unknown to buyers. This quality…

Computer Science and Game Theory · Computer Science 2024-11-13 Zhikang Fan , Weiran Shen

In repeated-game applications where both the collusive and non-collusive outcomes can be supported as equilibria, researchers must resolve underlying selection questions if theory will be used to understand counterfactual policies. One…

General Economics · Economics 2021-01-18 Emanuel Vespa , Taylor Weidman , Alistair J. Wilson