English
Related papers

Related papers: Optimal Stopping with Interdependent Values

200 papers

Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A…

Computer Science and Game Theory · Computer Science 2015-03-18 Mayur Mohite , Y. Narahari

This paper compares two leading approaches for robust optimization in the models of online algorithms and mechanism design. Competitive analysis compares the performance of an online algorithm to an offline benchmark in worst-case over…

Computer Science and Game Theory · Computer Science 2020-09-09 Jason Hartline , Aleck Johnsen , Yingkai Li

We study fair and efficient allocation of divisible goods, in an online manner, among $n$ agents. The goods arrive online in a sequence of $T$ time periods. The agents' values for a good are revealed only after its arrival, and the online…

Computer Science and Game Theory · Computer Science 2021-09-03 Siddharth Barman , Arindam Khan , Arnab Maiti

A principal who values an object allocates it to one or more agents. Agents learn private information (signals) from an information designer about the allocation payoff to the principal. Monetary transfer is not available but the principal…

Theoretical Economics · Economics 2022-10-31 Yi-Chun Chen , Gaoji Hu , Xiangqian Yang

This paper models the cyber-social system as a cyber-network of agents monitoring states of individuals in a social network. The state of each individual is represented by a social node and the interactions among individuals are represented…

Systems and Control · Computer Science 2020-04-22 Mohammadreza Doostmohammadian , Hamid R. Rabiee , Usman A. Khan

Online advertising has motivated interest in online selection problems. Displaying ads to the right users benefits both the platform (e.g., via pay-per-click) and the advertisers (by increasing their reach). In practice, not all users click…

Computer Science and Game Theory · Computer Science 2024-08-16 Sebastian Perez-Salazar , Mohit Singh , Alejandro Toriello

We study a continuous and infinite time horizon counterpart to the classic prophet inequality, which we term the stationary prophet inequality problem. Here, copies of a good arrive and perish according to Poisson point processes. Buyers…

Data Structures and Algorithms · Computer Science 2021-07-23 Kristen Kessel , Amin Saberi , Ali Shameli , David Wajc

In this paper, we consider a general distributed system with multiple agents who select and then implement actions in the system. The system has an operator with a centralized objective. The agents, on the other hand, are selfinterested and…

Computer Science and Game Theory · Computer Science 2020-01-15 Donya Ghavidel , Pratyush Chakraborty , Enrique Baeyens , Vijay Gupta , Pramod P. Khargonekar

This paper introduces a version of the interdependent value model of Milgrom and Weber (1982), where the signals are given by an index gathering signal shifters observed by the econometrician and private ones specific to each bidders. The…

Econometrics · Economics 2019-10-24 Nathalie Gimenes , Emmanuel Guerre

Human interactions are influenced by emotions, temperament, and affection, often conflicting with individuals' underlying preferences. Without explicit knowledge of those preferences, judging whether behaviour is appropriate becomes…

Computer Science and Game Theory · Computer Science 2025-11-05 Victor Villin , Christos Dimitrakakis

We study hidden-action principal-agent problems with multiple agents. These are problems in which a principal commits to an outcome-dependent payment scheme in order to incentivize some agents to take costly, unobservable actions that lead…

Computer Science and Game Theory · Computer Science 2023-02-01 Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

Prophet inequalities consist of many beautiful statements that establish tight performance ratios between online and offline allocation algorithms. Typically, tightness is established by constructing an algorithmic guarantee and a…

Computer Science and Game Theory · Computer Science 2025-03-14 Jiashuo Jiang , Will Ma , Jiawei Zhang

Recommender systems are the algorithms which select, filter, and personalize content across many of the worlds largest platforms and apps. As such, their positive and negative effects on individuals and on societies have been extensively…

Agreement Technologies refer to open computer systems in which autonomous software agents interact with one another, typically on behalf of humans, in order to come to mutually acceptable agreements. With the advance of AI systems in recent…

Computers and Society · Computer Science 2026-02-05 Andrés Holgado-Sánchez , Holger Billhardt , Alberto Fernández , Sascha Ossowski

Online platforms in the Internet Economy commonly incorporate recommender systems that recommend products (or "arms") to users (or "agents"). A key challenge in this domain arises from myopic agents who are naturally incentivized to exploit…

Information Retrieval · Computer Science 2024-06-19 Xiaowu Dai , Wenlu Xu , Yuan Qi , Michael I. Jordan

Over the past two decades, significant strides have been made in stochastic problems such as revenue-optimal auction design and prophet inequalities, traditionally modeled with $n$ independent random variables to represent the values of $n$…

Computer Science and Game Theory · Computer Science 2024-06-11 Vasilis Livanos , Kalen Patton , Sahil Singla

We examine hypothesis testing within a principal-agent framework, where a strategic agent, holding private beliefs about the effectiveness of a product, submits data to a principal who decides on approval. The principal employs a hypothesis…

Machine Learning · Computer Science 2025-08-06 Safwan Hossain , Yatong Chen , Yiling Chen

This paper studies dynamic mechanism design in a quasilinear Markovian environment and analyzes a direct mechanism model of a principal-agent framework in which the agent is allowed to exit at any period. We consider that the agent's…

Dynamical Systems · Mathematics 2021-05-10 Tao Zhang , Quanyan Zhu

Prophet inequality concerns a basic optimal stopping problem and states that simple threshold stopping policies -- i.e., accepting the first reward larger than a certain threshold -- can achieve tight $\frac{1}{2}$-approximation to the…

Computer Science and Game Theory · Computer Science 2024-10-31 Wei Tang , Haifeng Xu , Ruimin Zhang , Derek Zhu

Suppose a customer is faced with a sequence of fluctuating prices, such as for airfare or a product sold by a large online retailer. Given distributional information about what price they might face each day, how should they choose when to…

Data Structures and Algorithms · Computer Science 2019-10-10 Hossein Esfandiari , MohammadTaghi HajiAghayi , Brendan Lucier , Michael Mitzenmacher
‹ Prev 1 3 4 5 6 7 10 Next ›