• Aucun résultat trouvé

Can AI Algorithms Collude?

N/A
N/A
Protected

Academic year: 2021

Partager "Can AI Algorithms Collude?"

Copied!
54
0
0

Texte intégral

(1)

AI & Law

Can algorithms collude?

Keynote @ NICS 2018

(2)

Agenda

1. Personal Background & Research Group

2. Examples of AI & Law

1. Criminal Law

2. Competition Law/Antitrust

3. Algorithmic Collusion/Reinforcement Learning 4. Legal, Ethical Implications of AI

(3)
(4)

Brief Overview &

Research Group

• Assoc. Professor, HEC Liège, University of Liège Belgium

• Head Quantitative Methods Unit, HEC Liège

(5)

Brief Overview &

Research Group

• PhD candidates

(6)
(7)

Criminal Law

(8)

Criminal Law

Case of Eric Loomis

• Eric Loomis

• Five criminal offenses • Drive-by shooting

• Denies participation in shooting, but

• Pleads guilty on 2 minor charges

1. Attempting to flee a traffic officer

2. Operating a motor vehicle without the owner’s consent

(9)

Case of Eric Loomis (cont)

• Presentencing Investigation

• Offenders’ background information • Includes Recidivism Risk (score)

• Recidivism Risk Score predicted using COMPAS

• COMPAS (now Equivant)

• Machine Learning/Statistical Prediction Methods • Developed by Northpointe Inc (Michigan)

• Recidivism Risk Score: 1 -10

(10)

Case of Eric Loomis (cont)

• Sentencing Decision based on

• Crime seriousness • History

• COMPAS assessment: Loomis  high risk of recidivism

• Loomis sentenced

• 6 years imprisonment

(11)

Case of Eric Loomis (cont)

• Loomis refutes decision

• Filed for post-conviction relief • Requested new sentence hearing

“Violation of due right as COMPAS (tool) used for sentencing”

• Training Data

• Far more African-Americans classified as High Risk • Biased against African-Americans

(12)

Case of Eric Loomis (cont)

• Request for new hearing denied

• COMPAS used by court

• Corroborate/confirm decision • Same sentence without COMPAS

• COMPAS not biased against African-Americans

• Accurately discriminate between high and low risk regardless of race

• But COMPAS

• Not transparent/commercial software

(13)

Competition Law/Antitrust

(14)

Competition Law

Personalized Pricing

• Type of Price Discrimination

• Customers charged different prices • Based on WTP

• Staples

• Pricing based on

• Location, Distance from competitors’ stores

• Discounts if competitors within 20 miles of Staples store • See WSJ Article

(15)

Competition Law

Personalized Pricing (cont)

• TravelVelocity

• Pricing based on

• Browser (IE, FireFox, IE)

• Platform (OSX, iOS, Android, Windows) • Account log-in

• Amazon

• Clearing cache, deleting cookies

• Drop in DVD price: $26.24 to $22.74 • Customers refunded

(16)

Competition Law

Tacit Collusion

• Collusion (cartel formation)

• Agreement between firms (e.g. on price, quantity,…)

• Profits (under collusion) > Profits (under normal competition) • Explicit vs. tacit (with vs. without prior agreements)

• Illustration: Competitors on Paris-Saigon Trip

Competition Price: 1600 EUR Competition Price: 1400 EUR Collusive Price: 1700 EUR

Higher Profits

(17)

Competition Law

Tacit Collusion (cont)

• Firms in collusion

• Incentives to cheat/deviate from cooperative equilibrium • Setting lower price than collusive price

• Increase market share  more profits

Competition Price: 1600 EUR Competition Price: 1400 EUR Collusive Price: 1700 EUR

Higher Profits

COLLUSION

Deviation Price: 1500 EUR Higher Market Share

(18)

Competition Law

Tacit Collusion (cont)

• Punishment essential to discourage deviations

• Punishment mechanisms

• Temporary price wars; Reduce deviant firm’s profits • Should be costly compared to deviation profits

Competition Price: 1600 EUR Competition Price: 1400 EUR Collusive Price: 1700 EUR

Higher Profits

COLLUSION

Deviation Price: 1500 EUR Higher Market Share

PUNISHMENT

(19)

Algorithmic Collusion

• Advent of sophisticated AI

• Increase occurrences of tacit collusions

• More transparent markets

• Monitoring competitors’ prices easier

• More sophisticated learning paradigms

• Pricing algorithms learning how to adjust prices • Realize that Collusion  higher profits

• Algorithmic Collusion

(20)

Algorithmic Collusion (cont)

• Fundamental Question

Can algorithms learn how to collude?

• Collusion

• Coordinating on prices

• Punishing deviators (reduce incentives to cheat)

• Algorithmic collusion demonstrated

• Zhou et al. (2018) • Klein et al. (2018)

(21)

Algorithmic Collusion (cont)

• Simplified duopolistic environment

• Real-life oligopolist

• Algorithms (agents) follow pre-defined strategies

• No autonomous learning of behavior • E.g. in Zhou et al. (2018)

• Zero-Determinant (ZD) strategy in Iterated Prisoner’s Dilemma • ZD strategy coerces opponent to cooperate fully

(22)

Algorithmic Collusion (cont)

• Can algorithms collude?

• Still an open research question

• Addressed by large consortium: AI, Law, & Economics

(23)

Algorithmic Collusion

(cont)

• Reinforcement Learning (RL) Approach

• Class of AI methods

• Algorithms/Agents interact with environment

• Perform actions, e.g. increase, decrease, maintain price • Actions result in state transitions

(24)
(25)

Algorithmic Collusion (cont)

• Q-Learning for RL

• Commonly employed (cellular channel allocation, robotic control, wholesale electricity market)

• Q-value at the core of Q-learning

• Expected total reward, r,, e.g. profit

• Taking action a (e.g. increase price) in state s • γ: discount factor

• Agent computes Q-values

(26)

Algorithmic Collusion (cont)

• Optimal Q-value function, Q*

• Max. expected cumulative future rewards of a in s

(27)

Algorithmic Collusion (cont)

• Q-values maintained in Q-table (Tabular Q-learning)

• Agent takes actions

• Q-values updated

(28)

Algorithmic Collusion

(cont)

• Q-Learning Illustration

• Autonomous agent

(29)

Algorithmic Collusion

(cont)

(30)

Algorithmic Collusion

(cont)

(31)

Algorithmic Collusion

(cont)

• Initialize

• R (reward) matrix

• Q-matrix

(32)

Algorithmic Collusion

(cont)

(33)

Algorithmic Collusion

(cont)

• Until convergence

• Optimal Sequence

(34)

Algorithmic Collusion

(cont)

• But with n > 2 agents : Q-learning breaks down

• Explosion in space requirements, ���^�

• Exponential in the number of agents, possibly infinite

• Non-stationary environment

• Agents learning simultaneously

(35)
(36)

Algorithmic Collusion (cont)

• Deep Learning to learning Q-value

(37)

Algorithmic Collusion

• Deep-Q learning formulation algorithmic collusion

• N competing firms

• N algorithmic DQN agents

Experience Replay

to ensure convergence

• DQN agents’ actions

• {increase, decrease, maintain} price

• Objective

(38)

Algorithmic Collusion

• In game-theory

• Algoritmic collusion  social dilemma

• Social Dilemma?

• Capture reward (profit) individually, R1 • Coordinate and cooperate, reward R2 • R2 > R1

(39)

Algorithmic Collusion

• Game theoretic setting: stage-hunt game

• 2 Agents

• Hunt stags (High rewards)

• Collect mushrooms (Low rewards)

• But

• Impossible to hunt alone must cooperate to hunt

• Possible to collect mushrooms alone

(40)
(41)

Algorithmic Collusion

(cont)

• Agents implemented as Deep Q-Networks

• Deep Learning to approximate Q-function

• Loss function

• Backprop & gradient descent

(42)

Algorithmic Collusion

(cont)

• Allow agents to play

• Observe emergent behavior over multiple rounds

• Do agents cooperate for higher reward (hunt stag)?

• Does 1 agent deviate from cooperation? When?

(43)
(44)

Legal and Ethical Issues

• Transparency

• Transparency in the design of the algorithm

or

of inputs

and results?

• Carlson, 2017: private companies providing a public service

should be held to the same transparency requirements as

public agencies

”  trade secret

• Burrell, 2016: three types of opacity: intentional whether

corporate or state secrecy – technical illiteracy – opacity

due to machine learning characteristics

(45)

Legal and Ethical Issues

(cont’d)

• Explainability

• “

Explainability matters because the process of

reason-giving is intrinsic to juridical determinations

” (Pasquale,

2017)

• Accountability

• Who is accountable? Role of human beings?

• Due process (‘fair trial’) rights (Freeman, 2016)

• Important to be able to assess and monitor validity of

algorithms (how does it work?)

• Training judges to understand benefits and limitations of

algorithms

(46)

Références

Documents relatifs

Supervised learning theory tells us that generalization in this case is poor (not enough target data and it is difficult to rely on data coming from different

Les résultats des expérimentations montrent que les crypto-systèmes proposés sont capables de produire des SNPAs de très haute qualité et même de qualité supérieure

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

The rate of transcription initiation is the main level of quantitative control of gene expression, primarily responsible for the accumulation of mRNAs in the cell. Many, if not

[1] Sebastien Villon, Marc Chaumont, Gerard Subsol, Sebastien Villeger, Thomas Claverie, David Mouillot, "Coral reef fish detection and recognition in underwater videos

To analyse the need for training workers on farm management for a CLFIS and operational management of the production system for the farms of Roraima State, we carried out joint

In this paper, we make the following contributions: 1) we formalize the concept of equivalence between two learning algorithms and define two notions of algorithmic equivalence,

On the other hand, the application of penalized optimal scoring to block clustering looks more complex, but as block clustering is typically defined as a mixture model whose