English
Related papers

Related papers: Sequential selections with minimization of failure

200 papers

We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects…

Computer Science and Game Theory · Computer Science 2019-07-23 Yakov Babichenko , Oren Dean , Moshe Tennenholtz

Rank aggregation with pairwise comparisons is widely encountered in sociology, politics, economics, psychology, sports, etc . Given the enormous social impact and the consequent incentives, the potential adversary has a strong motivation to…

Artificial Intelligence · Computer Science 2024-07-03 Ke Ma , Qianqian Xu , Jinshan Zeng , Wei Liu , Xiaochun Cao , Yingfei Sun , Qingming Huang

We consider the problem of strategic classification, where a learner must build a model to classify agents based on features that have been strategically modified. Previous work in this area has concentrated on the case when the learner is…

Machine Learning · Computer Science 2025-05-19 Jack Geary , Henry Gouk

Strategic classification studies the design of a classifier robust to the manipulation of input by strategic individuals. However, the existing literature does not consider the effect of competition among individuals as induced by the…

Computer Science and Game Theory · Computer Science 2022-02-23 Lydia T. Liu , Nikhil Garg , Christian Borgs

We study a dynamic model of Bayesian persuasion in sequential decision-making settings. An informed principal observes an external parameter of the world and advises an uninformed agent about actions to take over time. The agent takes…

Computer Science and Game Theory · Computer Science 2022-05-25 Jiarui Gan , Rupak Majumdar , Goran Radanovic , Adish Singla

This paper argues that one of the most important decisions in designing and deploying censorship resistance systems is whether one set of system options should be selected (the best), or whether there should be several sets of good ones. We…

Cryptography and Security · Computer Science 2016-08-01 Tariq Elahi , Steven J. Murdoch , Ian Goldberg

As we know, there is a controversy about the decision making under risk between economists and psychologists. We discuss to build a unified theory of risky choice, which would explain both of compensatory and non-compensatory theories. For…

Economics · Quantitative Finance 2017-03-24 Lamb Wubin , Naixin Ren

Actionable recourse studies whether individuals can modify feasible features to overturn unfavorable outcomes produced by AI-assisted decision-support systems. However, many such systems operate in competitive settings, such as admission or…

Computer Science and Game Theory · Computer Science 2026-03-19 Ya-Ting Yang , Quanyan Zhu

We study optimal fidelity selection for a human operator servicing a queue of homogeneous tasks. The agent can service a task with a normal or high fidelity level, where fidelity refers to the degree of exactness and precision while…

Human-Computer Interaction · Computer Science 2023-10-10 Piyush Gupta , Vaibhav Srivastava

Peer reviews, evaluations, and selections are a fundamental aspect of modern science. Funding bodies the world over employ experts to review and select the best proposals from those submitted for funding. The problem of peer selection,…

Computer Science and Game Theory · Computer Science 2019-05-01 Haris Aziz , Omer Lev , Nicholas Mattei , Jeffrey S. Rosenschein , Toby Walsh

The Bayesian persuasion paradigm of strategic communication models interaction between a privately-informed agent, called the sender, and an ignorant but rational agent, called the receiver. The goal is typically to design a (near-)optimal…

Computer Science and Game Theory · Computer Science 2021-06-21 Ronen Gradwohl , Niklas Hahn , Martin Hoefer , Rann Smorodinsky

The stable marriage problem and its extensions have been extensively studied, with much of the work in the literature assuming that agents fully know their own preferences over alternatives. This assumption however is not always practical…

Computer Science and Game Theory · Computer Science 2016-03-21 Baharak Rastegari , Paul Goldberg , David Manlove

We consider a problem wherein jobs arrive at random times and assume random values. Upon each job arrival, the decision-maker must decide immediately whether or not to accept the job and gain the value on offer as a reward, with the…

Artificial Intelligence · Computer Science 2022-02-03 Danial Dervovic , Parisa Hassanzadeh , Samuel Assefa , Prashant Reddy

Decision making or scientific discovery pipelines such as job hiring and drug discovery often involve multiple stages: before any resource-intensive step, there is often an initial screening that uses predictions from a machine learning…

Methodology · Statistics 2023-05-30 Ying Jin , Emmanuel J. Candès

Selectivity estimation - the problem of estimating the result size of queries - is a fundamental problem in databases. Accurate estimation of query selectivity involving multiple correlated attributes is especially challenging. Poor…

Databases · Computer Science 2019-06-19 Shohedul Hasan , Saravanan Thirumuruganathan , Jees Augustine , Nick Koudas , Gautam Das

In modern sample-driven Prophet Inequality, an adversary chooses a sequence of $n$ items with values $v_1, v_2, \ldots, v_n$ to be presented to a decision maker (DM). The process follows in two phases. In the first phase (sampling phase),…

Optimization and Control · Mathematics 2022-09-30 Krishnendu Chatterjee , Mona Mohammadi , Raimundo Saona

Decision-makers in high-stakes selection processes often face a fundamental choice: whether to make decisions themselves or to delegate authority to another entity whose incentives may only be partially aligned with their own. Such…

Computers and Society · Computer Science 2026-01-16 Benjamin Fish , Diptangshu Sen , Juba Ziani

The prophet and secretary problems demonstrate online scenarios involving the optimal stopping theory. In a typical prophet or secretary problem, selection decisions are assumed to be immediate and irrevocable. However, many online settings…

Computer Science and Game Theory · Computer Science 2019-11-07 Tomer Ezra , Michal Feldman , Ilan Nehama

We study the prophet secretary problem, a well-studied variant of the classic prophet inequality, where values are drawn from independent known distributions but arrive in uniformly random order. Upon seeing a value at each step, the…

Computer Science and Game Theory · Computer Science 2023-05-19 Paul Dütting , Evangelia Gergatsouli , Rojin Rezvan , Yifeng Teng , Alexandros Tsigonias-Dimitriadis

In a dynamic matching market, such as a marriage or job market, how should agents balance accepting a proposed match with the cost of continuing their search? We consider this problem in a discrete setting, in which agents have cardinal…

Computer Science and Game Theory · Computer Science 2021-06-16 Ishan Agarwal , Richard Cole , Yixin Tao