English
Related papers

Related papers: Efficiently Learning from Revealed Preference

200 papers

The Assignment problem is a fundamental and well-studied problem in the intersection of Social Choice, Computational Economics and Discrete Allocation. In the Assignment problem, a group of agents expresses preferences over a set of items,…

Data Structures and Algorithms · Computer Science 2021-05-24 Barak Steindl , Meirav Zehavi

When faced with complex choices, users refine their own preference criteria as they explore the catalogue of options. In this paper we propose an approach to preference elicitation suited for this scenario. We extend Coactive Learning,…

Artificial Intelligence · Computer Science 2016-12-07 Stefano Teso , Paolo Dragone , Andrea Passerini

Real-life combinatorial optimization problems often involve several conflicting objectives, such as price, product quality and sustainability. A computationally-efficient way to tackle multiple objectives is to aggregate them into a…

Artificial Intelligence · Computer Science 2025-08-28 Marianne Defresne , Jayanta Mandi , Tias Guns

We study the problem of selection in the context of Bayesian persuasion. We are given multiple agents with hidden values (or quality scores), to whom resources must be allocated by a welfare-maximizing decision-maker. An intermediary with…

Computer Science and Game Theory · Computer Science 2025-11-18 Yannan Bai , Kamesh Munagala , Yiheng Shen , Davidson Zhu

Learning from demonstrations has gained increasing interest in the recent past, enabling an agent to learn how to make decisions by observing an experienced teacher. While many approaches have been proposed to solve this problem, there is…

Machine Learning · Computer Science 2017-02-28 Jürgen Hahn , Abdelhak M. Zoubir

Learning the preferences of a human improves the quality of the interaction with the human. The number of queries available to learn preferences maybe limited especially when interacting with a human, and so active learning is a must. One…

Machine Learning · Computer Science 2020-02-18 Sriram Gopalakrishnan , Utkarsh Soni

We apply recent advances in deep generative modeling to the task of imitation learning from biological agents. Specifically, we apply variations of the variational recurrent neural network model to a multi-agent setting where we learn…

Machine Learning · Computer Science 2020-07-02 Michael Teng , Tuan Anh Le , Adam Scibior , Frank Wood

Agent-based models help explain stock price dynamics as emergent phenomena driven by interacting investors. In this modeling tradition, investor behavior has typically been captured by two distinct mechanisms -- learning and heterogeneous…

Computers and Society · Computer Science 2025-11-12 Ryuji Hashimoto , Ryosuke Takata , Masahiro Suzuki , Yuki Tanaka , Kiyoshi Izumi

Agent-based models provide a constructive approach to studying emergent dynamics in life-like systems composed of interacting, adaptive agents. Financial markets serve as a canonical example of such systems, where collective price dynamics…

Computational Finance · Quantitative Finance 2026-04-28 Ryuji Hashimoto , Ryosuke Takata , Masahiro Suzuki , Yuki Tanaka , Kiyoshi Izumi

Selling a perfectly divisible item to potential buyers is a fundamental task with apparent applications to pricing communication bandwidth and cloud computing services. Surprisingly, despite the rich literature on single-item auctions,…

Computer Science and Game Theory · Computer Science 2025-02-11 Ioannis Caragiannis , Zhile Jiang , Apostolis Kerentzis

Understanding consumer preferences is essential to product design and predicting market response to these new products. Choice-based conjoint analysis is widely used to model user preferences using their choices in surveys. However,…

Consider the object allocation (one-sided matching) model of Shapley and Scarf (1974). When final allocations are observed but agents' preferences are unknown, when might the allocation be in the core? This is a one-sided analogue of the…

Theoretical Economics · Economics 2023-08-08 Andrew Tai

Learning a reward function from human preferences is challenging as it typically requires having a high-fidelity simulator or using expensive and potentially unsafe actual physical rollouts in the environment. However, in many tasks the…

Machine Learning · Computer Science 2022-02-18 Daniel Shin , Daniel S. Brown , Anca D. Dragan

Reinforcement learning (RL) agents optimize only the features specified in a reward function and are indifferent to anything left out inadvertently. This means that we must not only specify what to do, but also the much larger space of what…

Machine Learning · Computer Science 2019-04-22 Rohin Shah , Dmitrii Krasheninnikov , Jordan Alexander , Pieter Abbeel , Anca Dragan

Knowledge acquisition by consumers is a key process in the diffusion of innovations. However, in standard theories of the representative agent, agents do not learn and innovations are adopted instantaneously. Here, we show that in a…

Economics · Quantitative Finance 2018-07-02 Jean-Francois Mercure

We study the problem of learning to rank from pairwise preferences, and solve a long-standing open problem that has led to development of many heuristics but no provable results for our particular problem. Given a set $V$ of $n$ elements,…

Data Structures and Algorithms · Computer Science 2011-05-18 Nir Ailon

Autonomous agents must often detect affordances: the set of behaviors enabled by a situation. Affordance detection is particularly helpful in domains with large action spaces, allowing the agent to prune its search space by avoiding futile…

Artificial Intelligence · Computer Science 2018-09-03 Nancy Fulda , Daniel Ricks , Ben Murdoch , David Wingate

In principal-agent models, a principal offers a contract to an agent to perform a certain task. The agent exerts a level of effort that maximizes her utility. The principal is oblivious to the agent's chosen level of effort, and conditions…

Computer Science and Game Theory · Computer Science 2022-07-14 Alon Cohen , Moran Koren , Argyrios Deligkas

One of the most celebrated results in mechanism design is Myerson's characterization of the revenue optimal auction for selling a single item. However, this result relies heavily on the assumption that buyers are indifferent to risk. In…

Computer Science and Game Theory · Computer Science 2018-10-08 Evdokia Nikolova , Emmanouil Pountourakis , Ger Yang

We study the envy-free house allocation problem when agents have uncertain preferences over items and consider several well-studied preference uncertainty models. The central problem that we focus on is computing an allocation that has the…

Computer Science and Game Theory · Computer Science 2023-12-19 Haris Aziz , Isaiah Iliffe , Bo Li , Angus Ritossa , Ankang Sun , Mashbat Suzuki
‹ Prev 1 4 5 6 7 8 10 Next ›