English
Related papers

Related papers: Learning Unanimously Acceptable Lotteries via Quer…

200 papers

We explore the probabilistic foundations of shared control in complex dynamic environments. In order to do this, we formulate shared control as a random process and describe the joint distribution that governs its behavior. For…

Robotics · Computer Science 2015-08-10 Pete Trautman

Matching algorithms have demonstrated great success in several practical applications, but they often require centralized coordination and plentiful information. In many modern online marketplaces, agents must independently seek out and…

Computer Science and Game Theory · Computer Science 2025-01-14 Vade Shah , Bryce L. Ferguson , Jason R. Marden

Preference elicitation frameworks feature heavily in the research on participatory ethical AI tools and provide a viable mechanism to enquire and incorporate the moral values of various stakeholders. As part of the elicitation process,…

Computers and Society · Computer Science 2024-08-07 Kyle Boerstler , Vijay Keswani , Lok Chan , Jana Schaich Borg , Vincent Conitzer , Hoda Heidari , Walter Sinnott-Armstrong

We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms whose error/cost properties improve from step to step. These…

Quantum Physics · Physics 2007-05-23 Boleslaw Kacewicz

Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games…

Computer Science and Game Theory · Computer Science 2014-01-24 Romain Brenguier , Jean-François Raskin , Mathieu Sassolas

Auction theories are believed to provide a better selling opportunity for the resources to be allocated. Various organizations have taken measures to increase trust among participants towards their auction system, but trust alone cannot…

Theoretical Economics · Economics 2021-02-09 Ravin Kumar

In this paper, we investigate the online allocation problem of maximizing the overall revenue subject to both lower and upper bound constraints. Compared to the extensively studied online problems with only resource upper bounds, the…

Machine Learning · Computer Science 2023-01-31 Qixin Zhang , Wenbing Ye , Zaiyi Chen , Haoyuan Hu , Enhong Chen , Yang Yu

Learning under one-sided feedback (i.e., where we only observe the labels for examples we predicted positively on) is a fundamental problem in machine learning -- applications include lending and recommendation systems. Despite this, there…

Machine Learning · Computer Science 2020-10-14 Heinrich Jiang , Qijia Jiang , Aldo Pacchiano

Reinforcement Learning from Human Feedback (RLHF), the standard for aligning Large Language Models (LLMs) with human values, is known to fail to satisfy properties that are intuitively desirable, such as respecting the preferences of the…

Artificial Intelligence · Computer Science 2025-02-03 Roberto-Rafael Maura-Rivero , Marc Lanctot , Francesco Visin , Kate Larson

There is general consensus that it is important for artificial intelligence (AI) and machine learning systems to be explainable and/or interpretable. However, there is no general consensus over what is meant by 'explainable' and…

Artificial Intelligence · Computer Science 2018-10-02 Alun Preece , Dan Harborne , Dave Braines , Richard Tomsett , Supriyo Chakraborty

We consider a social planner faced with a stream of myopic selfish agents. The goal of the social planner is to maximize the social welfare, however, it is limited to using only information asymmetry (regarding previous outcomes) and cannot…

Computer Science and Game Theory · Computer Science 2019-05-15 Lee Cohen , Yishay Mansour

The recent enthusiasm for artificial intelligence (AI) is due principally to advances in deep learning. Deep learning methods are remarkably accurate, but also opaque, which limits their potential use in safety-critical applications. To…

Decision-making problems can be modeled as combinatorial optimization problems with Constraint Programming formalisms such as Constrained Optimization Problems. However, few Constraint Programming formalisms can deal with both optimization…

Artificial Intelligence · Computer Science 2022-05-24 Valentin Antuori , Florian Richoux

This work proposes a procedure for designing algorithms for specific adaptive data collection tasks like active learning and pure-exploration multi-armed bandits. Unlike the design of traditional adaptive algorithms that rely on…

Machine Learning · Computer Science 2025-03-11 Jifan Zhang , Lalit Jain , Kevin Jamieson

In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates…

Computer Science and Game Theory · Computer Science 2017-02-22 Nicolas Basset , Gilles Geeraerts , Jean-François Raskin , Ocan Sankur

The ubiquity of Large Language Models (LLMs) is driving a paradigm shift where user convenience supersedes computational efficiency. This article defines the "Plausibility Trap": a phenomenon where individuals with access to Artificial…

Artificial Intelligence · Computer Science 2026-01-22 Ivan Carrera , Daniel Maldonado-Ruiz

Classical optimization algorithms--hill climbing, simulated annealing, population-based methods--generate candidate solutions via random perturbations. We replace the random proposal generator with an LLM agent that reasons about evaluation…

Artificial Intelligence · Computer Science 2026-03-31 Yitao Li

Due to the importance of artificial intelligence (AI) in a variety of high-stakes decisions, such as loan approval, job hiring, and criminal bail, researchers in Explainable AI (XAI) have developed algorithms to provide users with recourse…

Computer Science and Game Theory · Computer Science 2023-01-31 Matthew Olckers , Toby Walsh

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

When there exists uncertainty, AI machines are designed to make decisions so as to reach the best expected outcomes. Expectations are based on true facts about the objective environment the machines interact with, and those facts can be…

Machine Learning · Computer Science 2024-07-09 Jinsook Kim