ALGORITHMIC GAME THEORY Incentive and Computation.

Slides:

Advertisements

Similar presentations

N-Player Games. A symmetric N-person game. 1)All players have same strategy sets 2)If you switch two players strategies, you switch their payoffs and.

Advertisements

Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.

Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.

Mechanism Design without Money Lecture 1 Avinatan Hassidim.

Game Theory S-1.

Game Theory Overheads. A game is a formal representation of a situation in which a number of decision makers (players) interact in a setting of strategic.

CSCE 489/689: Special Topics in ALGORITHMIC GAME THEORY Fall 2013 Prof: Evdokia Nikolova Lecture 1* * Based on slides by Prof. Costis Daskalakis.

Chapter 10 Game Theory and Strategic Behavior

1 Chapter 14 – Game Theory 14.1 Nash Equilibrium 14.2 Repeated Prisoners’ Dilemma 14.3 Sequential-Move Games and Strategic Moves.

Think more, think better… think strategically Juan D. Carrillo and Simon Wilkie University of Southern California Masiv 2014.

MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)

Introduction to Network Mathematics (3) - Simple Games and applications Yuedong Xu 16/05/2012.

EC941 - Game Theory Lecture 7 Prof. Francesco Squintani

What is a game?. Game: a contest between players with rules to determine a winner. Strategy: a long term plan of action designed to achieve a particular.

17. (A very brief) Introduction to game theory Varian, Chapters 28, 29.

Game Theory, Mechanism Design, Differential Privacy (and you). Aaron Roth DIMACS Workshop on Differential Privacy October 24.

Games What is ‘Game Theory’? There are several tools and techniques used by applied modelers to generate testable hypotheses Modeling techniques widely.

Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.

An Introduction to Game Theory Part I: Strategic Games

Language and Coordination. Convention in the Theory of Meaning.

The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.

Algoritmi per Sistemi Distribuiti Strategici

6.896: Topics in Algorithmic Game Theory Spring 2010 Constantinos Daskalakis vol. 1:

Game Theory Game theory models strategic behavior by agents who understand that their actions affect the actions of other agents. Useful to study –Company.

Decision Analysis April 11, Game Theory Frame Work Players ◦ Decision maker: optimizing agent ◦ Opponent  Nature: offers uncertain outcome  Competition:

Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.

Reviewing Bayes-Nash Equilibria Two Questions from the midterm.

6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 1.

Game Theory Here we study a method for thinking about oligopoly situations. As we consider some terminology, we will see the simultaneous move, one shot.

Guessing game Guess a number 0 to 100. The guess closest to 2/3 the average number wins a prize. Ties will be broken randomly. Please write your name and.

Introduction to Game Theory and Behavior Networked Life CIS 112 Spring 2009 Prof. Michael Kearns.

Time for playing games Form pairs You will get a sheet of paper to play games with You will have 12 minutes to play the games and turn them in.

Today: Some classic games in game theory

The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 8 Ýmir Vigfússon.

COMP/MATH 553: Algorithmic Game Theory Fall 2014 Yang Cai Lecture 1.

Mechanism Design without Money Lecture 2 1. Let’s start another way… Everyone choose a number between zero and a hundred, and write it on the piece of.

Brian Duddy.  Two players, X and Y, are playing a card game- goal is to find optimal strategy for X  X has red ace (A), black ace (A), and red two (2)

Introduction 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A.

Week 5 - Wednesday.  What did we talk about last time?  Exam 1!

Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.

The repeated games with lack of information on one side Now we focus on.

Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.

The Design & Analysis of the Algorithms Lecture by me M. Sakalli Download two pdf files..

Strategic Decisions in Noncooperative Games Introduction to Game Theory.

Dynamic Games & The Extensive Form

THE “CLASSIC” 2 x 2 SIMULTANEOUS CHOICE GAMES Topic #4.

Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.

Experimental Economics NSF short course David Laibson August 11, 2005.

Network Congestion Games

Lecture 5 Introduction to Game theory. What is game theory? Game theory studies situations where players have strategic interactions; the payoff that.

Lecture 12. Game theory So far we discussed: roulette and blackjack Roulette: – Outcomes completely independent and random – Very little strategy (even.

Shall we play a game? Game Theory and Computer Science Game Theory /06/05 - Zero-sum games - General-sum games.

How to Analyse Social Network? : Part 2 Game Theory Thank you for all referred contexts and figures.

That’s English! Collective Tutorial By Caroline Wright Teaching Unit – “Games of Chance”

6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.

A Mean-Risk Model for Stochastic Traffic Assignment Evdokia Nikolova Nicolas Stier-Moses Columbia University, New York, NY, & Universidad Di Tella, Buenos.

ECO290E: Game Theory Lecture 3 Why and How is Nash Equilibrium Reached?

By: Donté Howell Game Theory in Sports. What is Game Theory? It is a tool used to analyze strategic behavior and trying to maximize his/her payoff of.

Games, Strategies, and Decision Making By Joseph Harrington, Jr. First Edition Chapter 4: Stable Play: Nash Equilibria in Discrete Games with Two or Three.

Project BEST Game Theory.

Algorithmic Applications of Game Theory

Algorithmic Game Theory

Multiagent Systems Game Theory © Manfred Huber 2018.

Presented By Aaron Roth

EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF INDUSTRIAL ENGINEERING IENG314 OPERATIONS RESEARCH II SAMIR SAMEER ABUYOUSSEF

Game Theory: The Nash Equilibrium

Presentation transcript:

ALGORITHMIC GAME THEORY Incentive and Computation

Basic Parameters When: Tuesday/Thursday, 3:00-4:20 Where: Here! Who: Professor Aaron Roth TAs: Shahin Jabbari and Ishaan Nerurkar How: 4-5 problem sets (45%), 2 exams (50%), Participation (5%) Participation includes questions and discussion on Piazza. Make an account.

Basic Parameters Homework Policy: Reasonable Person Principle. Feel free to work together. (List who you worked with) (Everyone turns in their own assignment) (10% off per day late)

Algorithm Design vs. Mechanism Design

Algorithms vs. Games If we control the whole system, we can just design an algorithm.

Algorithms vs. Games Otherwise, we have to design the constraints and incentives so that agents in the system work to achieve our goals.

Algorithms vs. Games And once the rules are in place, predict what will happen…

This comes up all the time in CS…

This Class

Game Theory Basics What is a game? A set of Players A set of Actions A set of Payoffs

Game Theory 0,0-1,1 1,-1 0,0-1, 1 1, -10,0

How should you play a game? Myopically play to maximize your payoff? But other players will respond…

Can we predict outcomes? What happens if everyone plays “Rationally”? What if some people don’t?

Traffic Routing Town A Town B Suppose 100 drivers leave from town A towards town B. What is the traffic on the network? Every driver wants to minimize her own travel time. 50 In any unbalanced traffic pattern, all drivers on the most loaded path have incentive to switch their path. Delay is 1.5 hours for everybody at the unique Nash equilibrium

Traffic Routing Town A Town B A benevolent governor builds a superhighway connecting the short roads of the network. What is the traffic on the network now? 100 No matter what the other drivers are doing it is always better for me to follow the zig-zag path. Delay is 2 hours for everybody at the unique Nash equilibrium

Traffic Routing A B 100 A B 50 vs Adding a fast road on a road-network is not always a good idea! Braess’s paradox In the RHS network there exists a traffic pattern where all players have delay 1.5 hours. Price of Anarchy:measures the loss in system performance due to free-will

Can we influence outcomes? Can we change the rules of the game to encourage “rational” players to do what we want?

Computation? How does computational complexity affect our predictions? How does computational complexity limit our design choices?

Information? How does limited information affect our predictions? How does limited information limit our design choices?

How well can we expect to do? When playing a prediction game? (Horse betting) (Investing in stocks)

An Easy Game (Prisoner’s Dilemma) Stay SilentTestify Stay Silent 5 Years, 5 Years50 Years, 3 Years Testify 3 Years, 50 Years40 Years, 40 Years

Guess Two-Thirds of the Average - k players p 1, p 2, p 3, …, p k - each player submits a number in [0,100] - compute - find x j, closest to - player p j wins $1, all other players win nothing Let’s Play!

A: no (why?) A: no (same reasons) … Guess Two-Thirds of the Average Rationality versus common knowledge of rationality historical facts: 21.6 was the winning value in a large internet-based competition organized by the Danish newspaper Politiken. This included 19,196 people and with a prize of 5000 Danish kroner.Politiken

IS COMMON KNOWLEDGE REASONABLE? THE PARABLE OF THE ISLANDERS On an isolated island, 100 logicians live in total isolation. They have developed a quirky culture: 1.If any islander can deduce that he has blue eyes, he must kill himself on the beach of midnight that night. 2.No islander may tell another that she has blue eyes. Another quirk: All of the islanders are blue-eyed. Since there are no mirrors and the water is murky, no one has ever known their own eye color, and they have lived in harmony for hundreds of years with no suicides.

IS COMMON KNOWLEDGE REASONABLE? THE PARABLE OF THE ISLANDERS One day, an explorer arrives on the island and addresses the islanders with a faux-pas. “At Least One of You Has Blue Eyes,” he tells them. Due to the explorers terrible breach in manners, the islanders quickly dispatch of him, but the damage has already been done. Has anything changed? What happens?