English
Related papers

Related papers: Random Serial Dictatorship with Transfers

200 papers

Exploration and adaptation to new tasks in a transfer learning setup is a central challenge in reinforcement learning. In this work, we build on the idea of modeling a distribution over policies in a Bayesian deep reinforcement learning…

Machine Learning · Computer Science 2019-06-11 Disha Shrivastava , Eeshan Gunesh Dhekane , Riashat Islam

Different models to study the wealth distribution in an artificial society have considered a transactional dynamics as the driving force. Those models include a risk aversion factor, but also a finite probability of favoring the poorer…

Physics and Society · Physics 2009-11-11 M. A. Fuentes , M. N. Kuperman , J. R. Iglesias

Imitation is widely observed in populations of decision-making agents. Using our recent convergence results for asynchronous imitation dynamics on networks, we consider how such networks can be efficiently driven to a desired equilibrium…

Computer Science and Game Theory · Computer Science 2017-04-17 James Riehl , Pouria Ramazi , Ming Cao

Models to mimic the transmission of information in financial markets are introduced. As an attempt to generate the demand process, we distinguish between dictatorship associations, where groups of agents rely on one of them to make…

adap-org · Physics 2009-10-31 R. d'Hulst , G. J. Rodgers

In networks of independent entities that face similar predictive tasks, transfer machine learning enables to re-use and improve neural nets using distributed data sets without the exposure of raw data. As the number of data sets in business…

Machine Learning · Computer Science 2020-03-31 Robin Hirt , Akash Srivastava , Carlos Berg , Niklas Kühl

We are interested in how to design reinforcement learning agents that provably reduce the sample complexity for learning new tasks by transferring knowledge from previously-solved ones. The availability of solutions to related problems…

Machine Learning · Computer Science 2020-07-03 Andrea Tirinzoni , Riccardo Poiani , Marcello Restelli

This paper contributes a new approach for distributional reinforcement learning which elucidates a clean separation of transition structure and reward in the learning process. Analogous to how the successor representation (SR) describes the…

A fundamental concept in control theory is that of controllability, where any system state can be reached through an appropriate choice of control inputs. Indeed, a large body of classical and modern approaches are designed for controllable…

Optimization and Control · Mathematics 2022-06-13 Yonathan Efroni , Sham Kakade , Akshay Krishnamurthy , Cyril Zhang

A computational model for the distribution of wealth among the members of an ideal society is presented. It is determined that a realistic distribution of wealth depends upon two mechanisms: an asymmetric flux of wealth in trading…

Statistical Mechanics · Physics 2008-12-02 Nicola Scafetta , Sergio Picozzi , Bruce J. West

In the sequential learning problem, agents in a network attempt to predict a binary ground truth, informed by both a noisy private signal and the predictions of neighboring agents before them. It is well known that social learning in this…

Social and Information Networks · Computer Science 2026-02-10 William Guo , Edward Xiong , Jie Gao

Stochastic processes can model many emerging phenomena on networks, like the spread of computer viruses, rumors, or infectious diseases. Understanding the dynamics of such stochastic spreading processes is therefore of fundamental interest.…

Social and Information Networks · Computer Science 2019-01-07 Gerrit Großmann , Verena Wolf

A network of agents attempt to learn some unknown state of the world drawn by nature from a finite set. Agents observe private signals conditioned on the true state, and form beliefs about the unknown state accordingly. Each agent may face…

Machine Learning · Computer Science 2015-03-13 Shahin Shahrampour , Mohammad Amin Rahimian , Ali Jadbabaie

The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed that a similar impossibility result holds even if we consider…

Computer Science and Game Theory · Computer Science 2015-04-13 Samantha Leung , Edward Lui , Rafael Pass

Transfer reinforcement learning (RL) methods leverage on the experience collected on a set of source tasks to speed-up RL algorithms. A simple and effective approach is to transfer samples from source tasks and include them into the…

Artificial Intelligence · Computer Science 2011-09-02 Alessandro Lazaric , Marcello Restelli

We consider a discrete-time nonatomic routing game with variable demand and uncertain costs. Given a routing network with single origin and destination, the cost function of each edge depends on some uncertain persistent state parameter. At…

Theoretical Economics · Economics 2021-10-04 Emilien Macault , Marco Scarsini , Tristan Tomala

We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a…

Formal Languages and Automata Theory · Computer Science 2017-07-10 Nathalie Bertrand , Miheer Dewaskar , Blaise Genest , Hugo Gimbert

A strictly strategy-proof mechanism is one that asks agents to use strictly dominant strategies. In the canonical one-dimensional mechanism design setting with private values, we show that strict strategy-proofness is equivalent to strict…

Theoretical Economics · Economics 2020-07-28 Matteo Escudé , Ludvig Sinander

We study the roles of social and individual learning on outcomes of the Minority Game model of a financial market. Social learning occurs via agents adopting the strategies of their neighbours within a social network, while individual…

Physics and Society · Physics 2024-03-05 Bryce Morsky , Fuwei Zhuang , Zuojun Zhou

We propose a data-driven control method for systems with aleatoric uncertainty, for example, robot fleets with variations between agents. Our method leverages shared trajectory data to increase the robustness of the designed controller and…

Robotics · Computer Science 2024-03-25 Alexander von Rohr , Dmitrii Likhachev , Sebastian Trimpe

Designing two-sided matching mechanisms is challenging when practical demands for matching outcomes are difficult to formalize and the designed mechanism must satisfy theoretical conditions. To address this, prior work has proposed a…

Artificial Intelligence · Computer Science 2025-07-31 Ryota Maruo , Koh Takeuchi , Hisashi Kashima