Mediators Slides by Sherwin Doroudi Adapted from “Mediators in Position Auctions” by Itai Ashlagi, Dov Monderer, and Moshe Tennenholtz.

Slides:



Advertisements
Similar presentations
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Advertisements

Performance Evaluation Sponsored Search Markets Giovanni Neglia INRIA – EPI Maestro 4 February 2013.
EC941 - Game Theory Prof. Francesco Squintani Lecture 4 1.
CPS Bayesian games and their use in auctions Vincent Conitzer
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.
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Joint Strategy Fictitious Play Sherwin Doroudi. “Adapted” from J. R. Marden, G. Arslan, J. S. Shamma, “Joint strategy fictitious play with inertia for.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
6.853: Topics in Algorithmic Game Theory Fall 2011 Matt Weinberg Lecture 24.
An Introduction to Game Theory Part I: Strategic Games
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Algorithmic Applications of Game Theory Lecture 8 1.
Mechanism Design and the VCG mechanism The concept of a “mechanism”. A general (abstract) solution for welfare maximization: the VCG mechanism. –This is.
An Introduction to Game Theory Part IV: Games with Imperfect Information Bernhard Nebel.
An Introduction to Game Theory Part II: Mixed and Correlated Strategies Bernhard Nebel.
Strong Implementation of Social Choice Functions in Dominant Strategies Clemens ThielenSven O. Krumke 3rd International Workshop on Computational Social.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
Mediators in Position Auctions Itai Ashlagi Dov Monderer Moshe Tennenholtz Technion.
THE PROBLEM OF MULTIPLE EQUILIBRIA NE is not enough by itself and must be supplemented by some other consideration that selects the one equilibrium with.
SECOND PART: Algorithmic Mechanism Design. Mechanism Design MD is a subfield of economic theory It has a engineering perspective Designs economic mechanisms.
Free-rider problem in peer-to- peer networks Sumitra Ganesh.
Extensive Game with Imperfect Information Part I: Strategy and Nash equilibrium.
SECOND PART: Algorithmic Mechanism Design. Suggested readings Algorithmic Game Theory, Edited by Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V.
DANSS Colloquium By Prof. Danny Dolev Presented by Rica Gonen
EC941 - Game Theory Francesco Squintani Lecture 3 1.
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
Social Choice Session 7 Carmen Pasca and John Hey.
CPS 173 Mechanism design Vincent Conitzer
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Dynamic Games of complete information: Backward Induction and Subgame perfection - Repeated Games -
More on Social choice and implementations 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A Using slides by Uri.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
By: Amir Ronen, Department of CS Stanford University Presented By: Oren Mizrahi Matan Protter Issues on border of economics & computation, 2002.
Moshe Tennenholtz, Aviv Zohar Learning Equilibria in Repeated Congestion Games.
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 4.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Ad Auctions: Game-Theoretic Perspectives Moshe Tennenholtz Technion—Israel Institute of Technology and Microsoft Research.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Game theory, alive: some advanced topics presentation by: Idan Haviv supervised by: Amos Fiat.
3.1.4 Types of Games. Strategic Behavior in Business and Econ Outline 3.1. What is a Game ? The elements of a Game The Rules of the Game:
Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Mechanism Design with Strategic Mediators Moran Feldman EPFL Joint work with: Moshe Babaioff, Microsoft Research Moshe Tennenholtz, Technion.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2009 Lecture 1 A Quick Review of Game Theory and, in particular, Bayesian Games.
Incomplete Information and Bayes-Nash Equilibrium.
1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAA A AA A.
Comp/Math 553: Algorithmic Game Theory Lecture 11
Bayesian games and mechanism design
Comp/Math 553: Algorithmic Game Theory Lecture 08
CPS Mechanism design Michael Albert and Vincent Conitzer
Econ 805 Advanced Micro Theory 1
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
EASTERN MEDITERRANEAN UNIVERSITY DEPARTMENT OF INDUSTRIAL ENGINEERING IENG314 OPERATIONS RESEARCH II SAMIR SAMEER ABUYOUSSEF
Bayes Nash Implementation
Information, Incentives, and Mechanism Design
Auction Theory תכנון מכרזים ומכירות פומביות
Vincent Conitzer CPS Mechanism design Vincent Conitzer
CPS Bayesian games and their use in auctions
Presentation transcript:

Mediators Slides by Sherwin Doroudi Adapted from “Mediators in Position Auctions” by Itai Ashlagi, Dov Monderer, and Moshe Tennenholtz

Bayesian & Pre-Bayesian Games Consider a game where every player has private information regarding his/her “type” A player’s strategy maps types to actions Ex: You are either type A or type B and you have actions “play” and “pass”; one strategy might be A→ “play” and B→ “pass”; we can write this as (A, B) → (“play”, “pass”)

Bayesian & Pre-Bayesian Games These are games of incomplete information In a Bayesian Game there is a commonly known prior probability measure on the profile of types Ex: You are either type A or B, I am either type X or Y, and we know that it is common knowledge that our types are equality likely to be (A, X), (A, Y), (B, X), or (B, Y)

Bayesian & Pre-Bayesian Games In a pre-Bayesian game, there is no prior probability over they types the players can take Ex: An auction setting in which there is no known distribution with which the players value the goods We will be concerned only with pre-Bayesian games

Equilibria in Pre-Bayesian Games When priors regarding types are not known (i.e. in pre-Bayesian game) we are primarily concerned with ex post equilibrium “A profile of strategies, one for each player, such that no player has a profitable deviation independently of the types of the other players” Requiring dominant strategies is stricter

Ex: Pre-Bayesian Game Game H: Assume player I has only one type but player II is either type A or type B I II α β α β Type(II) = A I II α β α β Type(II) = B

Ex: Pre-Bayesian Game Game H: The ex post equilibrium is I plays β and II plays (A, B) →(β, α) I II α β β α β β Type(II) = A I II α β β α α β Type(II) = B

Question In general, do all pre-Bayesian games have at least one ex post equilibrium?

Another Pre-Bayesian Game Game G: As before, player I has only one type but player II is either type A or type B I II α β α β Type(II) = A I II α β α β Type(II) = B

Another Pre-Bayesian Game Game G: Player I has different strictly dominant strategies depending on II’s type I II α α β α β Type(II) = A I II α β β α β Type(II) = B

Another Pre-Bayesian Game Game G: BUT! Player I has no idea which type II is, so no ex post equilibrium exists I II α α β α b Type(II) = A I II α b b α β Type(II) = B

Some Bad News… So we have seen that not all pre-Bayesian games have an ex post equilibrium. What can we do to rectify this situation? Will allowing for mixed strategies help? Can we modify or “transform” these “problematic” games such as G, so as to “give” such games nicer properties?

Mediators We introduce a mediator, “a reliable entity that can interact with the players and perform on their behalf actions in a given game” Players need not make use of the mediator’s services Now players can choose to play a strategy or ask the mediator to play for them (by revealing to the mediator their type)

Mediators Since a mediator acts reliably and deterministically given what information the mediator is given, the mediator should not be thought of as a player (even in the simple sense where “Nature” is often considered a player) Rather, the mediator expands the strategies available to the existing players

Mediators In games such as auctions where players’ actions are equal to their possible types (i.e. where actions are tantamount to revealing a type), strategies involve revealing a type given a true type, so adding a mediator turns the action space into two copies of itself, a revelation of type, or a telling of this type to the mediator

Revisiting Game G Consider this mediator: If both players request mediator services, (α, α) or (β, β) is played when II reports A or B respectively If only I seeks the mediator, α is played for I If only II seeks the mediator, α (resp. β) is played if A (resp. B) is reported I II α β α β Type(II) = A I II α β α β Type(II) = B

Mediated Game G Let m denote requesting mediator services: m α m-Am-B β αβ 2 Type(II)=A I II

Mediated Game G (contd.) Let m denote requesting mediator services: m α m-Am-B β αβ 2 Type(II)=B I II

What Did We Accomplish? We used a mediator to “transform” the problematic no-equilibrium game G into one with an ex post equilibrium The new ex post equilibrium is simply the one that calls for both players to make use of the mediator’s services and to report their true type (if applicable) to the mediator “Incentive compatibility”

Where Can We Go With This? We can “improve” many pre-Bayesian games by adding a mediator, though we must choose carefully how this mediator acts We can turn mechanisms that do not promote truthful direct revelation into mechanisms that do promote truthful revelations When is “fixing” mechanisms really necessary, though?

In Particular… We can consider position auctions that do not necessarily have equilibrium and try to transform them into VCG auctions Many existing auctions are not VCG, even though VCG has nice (at least theoretical) properties, such as ex post equilibrium existence Why not just change the auction to VCG?

Ex: A Two-Player Self-Price Auction Consider a self-price auction with two players and one good (or one position with a click- through rate of 1) For c ≥ 1, the mediator m[c], seeing player I report value u and player II report value v bids v for I and 0 for II if u ≥ v and 0 for I and u for II If only one player uses the mediator, reporting w, the mediator bids cw on their behalf

Ex: A Two-Player Self-Price Auction Using a T-strategy (truthfully reporting ones type to the mediator) implements a VCG outcome For c > 1 this is T-strategy is not dominant, and could cause negative utilities, so c = 1 is the natural choice here We’ve transformed a self-price auction into a next-price (VCG w/ 2 players)!

Valid Mediators In the previous example the mediator seemingly tries to “punish” the player who doesn’t use the mediator by submitting a high bid for the player using the mediator—this hurts the player using the mediator more; this is OK, but… we don’t want negative utilities Valid mediators implement only nonnegative utilities for players using the T-strategy

What Else Can We Do? Implementing a VCG outcome via mediators in some special cases of: Generalized next-price position auctions K-next-price positions auctions Weighted next-price positions auctions Google-like position auctions Self-position auctions (with > 1 positions)???

Conclusion We have shown that mediators allow us to transform pre-Bayesian games to allow for useful properties (such as equilibrium existence) In particular we examined that some position auctions can have a VCG-outcome implemented via the use of such mediators

Shortcomings of VCG Mechanisms Adapted from “Thirteen Reasons Why the Vickrey-Clarke-Groves Process Is Not Practical” by Michael H. Rothkopf

Some Problems w/ VCG Dominant strategy equilibria are weak; other weak equilibria may exist Exponential growth of effort NP completeness of winner determination problem Process can be revenue deficient

VCG Allows for Cheating Conspiracies by competing bidders Sequence of strategy proof auctions need not be strategy-proof False-name bids by single bidders False-name bids by the auctioneer What if our mediator is not reliable?

Concluding Question What is the real advantage in transforming designed mechanisms into VCG mechanisms if they were not designed to be VCG in the first place?