Duncan Mhakure (November 25th 2019). Using the Research Tutorial as a Training Strategy for Tutor Professional Development in an Undergraduate Course, Pedagogy in Basic and Higher Education - Current Developments and Challenges, Kirsi Tirri and Auli Toom, IntechOpen, DOI: 10.5772/intechopen.90150.

Soo Wook Kim and Kanghwa Choi (February 1st 2008). A Dynamic Resource Allocation on Service Supply Chain, Supply Chain, Vedran Kordic, IntechOpen, DOI: 10.5772/5351.

New Zealand

Fairness in algorithmic decision-making has received growing attention recently. However, fairness in the context of resource allocation has been formally studied for many decades in microeconomics, and for a few decades in computer science. This tutorial will present an overview of this literature, its various fairness definitions, and fair algorithms. The focus will be on recent advances, but no prior background will be required.

The first part of the tutorial will look at the classic setting of cake-cutting, which models allocation of a divisible resource. This part will cover classic fairness notions such as proportionality, envy-freeness, equitability, and Pareto optimality, and explore their interplay with game-theoretic notions such as strategyproofness. This part will end with a discussion on connections between fairness and market equilibria.

The second part of the tutorial will focus on the allocation of indivisible items. This will cover relaxations of proportionality, envy-freeness, and equitability, as well as other fairness notions such as maximin share guarantee. This part will explore static versus dynamic allocations, goods versus chores, private versus public goods, etc.

The tutorial will end with a high-level discussion on how to apply these fairness definitions in other contexts such as voting, machine learning, or ethical decision-making.

AAMAS 2020

Recent Advances in Fair Resource Allocation Tutorial Part 2

stages 

COLING, the International Conference on Computational Linguistics, is one of the premier conferences for natural language processing and computational linguistics. Often grouped within the field of artificial intelligence, but actually pre-dating the development of artificial intelligence, advances in computational linguistics and natural language processing are now some of the major drivers behind the use of artificial intelligence for commercial and social applications – for example, on-line search, machine translation and with voice-assisted conversational devices.

First established in 1965, the biennial COLING conference is held in diverse parts of the globe and attracts participants from both top-ranked research centers and emerging countries. Today, the most important developments in our field are taking place not only in universities and academic research institutes, but also in industrial research departments and in technological startups. COLING conferences provide opportunities for all these communities to showcase their exciting developments.

COLING 2020

COLING, the International Conference on Computational Linguistics, is one of the premier conferences for natural language processing and computational linguistics. Often grouped within the field of artificial intelligence, but actually pre-dating the development of artificial intelligence, advances in computational linguistics and natural language processing are now some of the major drivers behind the use of artificial intelligence for commercial and social applications – for example, on-line search, machine translation and with voice-assisted conversational devices.

technical paper

AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). The aim of the joint conference is to provide a single, high-profile, internationally-respected archival forum for scientific research in the theory and practice of autonomous agents and multi-agent systems.

Browse keynotes, discussions, panels and over 300 presentations.


AAMAS is the leading scientific conference for research in autonomous agents and multi-agent systems. The AAMAS conference series was initiated in 2002 as the merging of three respected scientific meetings: the International Conference on Multi-Agent Systems (ICMAS), the International Workshop on Agent Theories, Architectures, and Languages (ATAL), and the International Conference on Autonomous Agents (AA). 

Fair Division of the Commons

Probabilistic Physical Search on General Graphs: Approximations and Heuristics

Task Allocation Strategy for Heterogeneus Robot Teams in Offshore MIssions

A Very Short Survey and Critique of Multiagent Deep Reinforcement Learning

AAMAS 2020  - Day 1

We study online learning settings in which experts act strategically to maximize their influence on the learning algorithm’s predictions by potentially misreporting their beliefs about a sequence of binary events. Our goal is twofold. First, we want the learning algorithm to be no-regret with respect to the best-fixed expert in hindsight. Second, we want incentive compatibility, a guarantee that each expert’s best strategy is to report his true beliefs about the realization of each event. To achieve this goal, we build on the literature on wagering mechanisms, a type of multi-agent scoring rule. We provide algorithms that achieve no regret and incentive compatibility for myopic experts for both the full and partial information settings. In experiments on datasets from FiveThirtyEight, our algorithms have regret comparable to classic no-regret algorithms, which are not incentive-compatible. Finally, we identify an incentive-compatible algorithm for forward-looking strategic agents that exhibits diminishing regret in practice.

No-Regret and Incentive-Compatible Online Learning

The Gibbard-Satterthwaite theorem states that no non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not-obvious manipulability that was proposed by Troyan and Morrill (2019). We identify several classes of voting rules that that satisfy this notion.We also show that several voting rules including k-approval fail to satisfy this property, i.e., satisfy this property. One of our insights is that certain rules are obviously manipulable when the number of alternatives is relatively large as compared to the number of voters. In contrast to the Gibbard-Satterthwaite theorem, many of the rules we examined were not-obviously manipulable. This reflects the relatively easier satisfiability of the notion and the zero information assumption of not-obvious manipulability, as opposed to the perfect information assumption of strategyproofness.

Obvious Manipulability of Voting Rules

Multi-task IRL allows for the possibility that the expert could be switching between multiple ways of solving the same problem, or interleaving demonstrations of multiple tasks. The learner aims to learn the multiple reward functions that guide these ways of solving the problem. We present a new method for multi-task IRL that generalizes the well-known maximum entropy approach to IRL by combining it with the Dirichlet process based clustering of the observed input. This yields a single nonlinear optimization problem, called MaxEnt Multi-task IRL, which can be solved using the Lagrangian relaxation and gradient descent methods. We evaluate MaxEnt Multi-task IRL in simulation on the robotic task of sorting onions on a processing line where the expert utilizes multiple ways of detecting and removing blemished onions. The method is able to learn the underlying reward functions to a good level of accuracy and it improves on the previous best approach to multi-task IRL.

Maximum Entropy Multi-Task Inverse RL

When designing swarm-robotic systems, systematic compar- ison of algorithms from different domains is necessary to determine which is capable of scaling up to handle the target problem size and target oper- ating conditions. Quantitative metrics capable of addressing these needs during the system design process exist for some of the main principles in swarm robotics: scalability, flexibility, and emergence. We define an additional metric to measure robustness along the axes of (1) sensor and actuator noise, (2) fluctuating population sizes, using mathematical curve similarity measures and queueing theory, respectively. We show that robustness analysis is a crucial part of the design process, and that our metric provides intuitive insights into algorithm selection on many real-world problems of interest which are well modeled as object gather- ing problems with (1) temporally varying swarm sizes, (2) and unreliable robots operating in noisy environments.

Recent Advances in Fair Resource Allocation Tutorial Part 2

Downloads

Next from AAMAS 2020

Fair Division of the Commons

Similar lecture

Merge and Recognize: A Geometry and 2D Context Aware Graph Model for Named Entity Recognition from Visual Documents

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Recent Advances in Fair Resource Allocation Tutorial Part 2

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AAMAS 2020

Fair Division of the Commons

Similar lecture

Merge and Recognize: A Geometry and 2D Context Aware Graph Model for Named Entity Recognition from Visual Documents

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES

Downloads