Enforcing Truthful-Rating Equilibria in Electronic Marketplaces T. G. Papaioannou and G. D. Stamoulis Networks Economics & Services Lab, Dept.of Informatics,

Slides:



Advertisements
Similar presentations
Eliciting Honest Feedback 1.Eliciting Honest Feedback: The Peer-Prediction Model (Miller, Resnick, Zeckhauser) 2.Minimum Payments that Reward Honest Feedback.
Advertisements

Fostering Wireless Spectrum Sharing via Subsidization Allerton 2013 Murat Yuksel Computer Science and Engineering Department, University of Nevada, Reno.
Ultimatum Game Two players bargain (anonymously) to divide a fixed amount between them. P1 (proposer) offers a division of the “pie” P2 (responder) decides.
1 CS 6910: Advanced Computer and Information Security Lecture on 11/2/06 Trust in P2P Systems Ahmet Burak Can and Bharat Bhargava Center for Education.
DARWIN: Distributed and Adaptive Reputation Mechanism for Wireless Ad- hoc Networks CHEN Xiao Wei, Cheung Siu Ming CSE, CUHK May 15, 2008 This talk is.
1 Industrial Organization Collusion Univ. Prof. dr. Maarten Janssen University of Vienna Summer semester Week 17.
Games With No Pure Strategy Nash Equilibrium Player 2 Player
Chapter 14 Infinite Horizon 1.Markov Games 2.Markov Solutions 3.Infinite Horizon Repeated Games 4.Trigger Strategy Solutions 5.Investing in Strategic Capital.
The basics of Game Theory Understanding strategic behaviour.
Game Theory and Computer Networks: a useful combination? Christos Samaras, COMNET Group, DUTH.
1/22 Competitive Capacity Sets Existence of Equilibria in Electricity Markets A. Downward G. ZakeriA. Philpott Engineering Science, University of Auckland.
On the Economics of P2P Systems Speaker Coby Fernandess.
Information Sharing Using an Electronic Marketplace David Montana, Alice Leung and Marshall Brinn BBN Technologies.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
1 1 Lesson overview BA 592 Lesson I.10 Sequential and Simultaneous Move Theory Chapter 6 Combining Simultaneous and Sequential Moves Lesson I.10 Sequential.
Chapter 7 Introduction to Sampling Distributions
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
Radu Jurca DIP internal workshop, EPFL, 2005 Trust, Reputation and Incentives in Online Environments Radu Jurca, Boi Faltings
CS522: Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian
1/55 EF 507 QUANTITATIVE METHODS FOR ECONOMICS AND FINANCE FALL 2008 Chapter 10 Hypothesis Testing.
Performance Analysis of Reputation-based Mechanisms for Multi-hop Wireless Networks Fabio Milan Dipartimento di Elettronica Politecnico di Torino Turin,
On Bounded Rationality and Computational Complexity Christos Papadimitriou and Mihallis Yannakakis.
8-1 Copyright ©2011 Pearson Education, Inc. publishing as Prentice Hall Chapter 8 Confidence Interval Estimation Statistics for Managers using Microsoft.
Copyright ©2011 Pearson Education 8-1 Chapter 8 Confidence Interval Estimation Statistics for Managers using Microsoft Excel 6 th Global Edition.
7-2 Estimating a Population Proportion
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
Anonymizing Web Services Through a Club Mechanism With Economic Incentives Mamata Jenamani Leszek Lilien Bharat Bhargava Department of Computer Sciences.
L2: Market Efficiency 1 Efficient Capital Market (L2) Defining efficient capital market Defining the value of information Example Value of information.
Learning dynamics,genetic algorithms,and corporate takeovers Thomas H. Noe,Lynn Pi.
Chapter 10 Hypothesis Testing
Confidence Intervals and Hypothesis Testing - II
Fundamentals of Hypothesis Testing: One-Sample Tests
Allerton 2011 September 28 Mathias Humbert, Mohammad Hossein Manshaei, and Jean-Pierre Hubaux EPFL - Laboratory for Communications and Applications (LCA1)
A Game Theoretic Framework for Incentives in P2P Systems --- CS. Uni. California Jun Cai Advisor: Jens Graupmann.
Asymmetric Information
Enhanced Annuities, Individual Underwriting, and Adverse Selection August 6, Enhanced Annuities, Individual Underwriting, and Adverse Selection.
Slide Slide 1 Chapter 8 Sampling Distributions Mean and Proportion.
Mechanisms for Making Crowds Truthful Andrew Mao, Sergiy Nesterko.
Basic Business Statistics, 11e © 2009 Prentice-Hall, Inc. Chap 8-1 Chapter 8 Confidence Interval Estimation Basic Business Statistics 11 th Edition.
Confidence Interval Estimation
1 Risk Based Negotiation of Service Agent Coalitions Bastian Blankenburg, Matthias KluschDFKI Minghua He, Nick JenningsUniversity of Southampton.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
1 Introduction to Hypothesis Testing. 2 What is a Hypothesis? A hypothesis is a claim A hypothesis is a claim (assumption) about a population parameter:
The Moral Hazard Problem Stefan P. Schleicher University of Graz
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
Incentive Compatible Assured Information Sharing Murat Kantarcioglu.
Inoculation Strategies for Victims of Viruses and the Sum-of-Squares Partition Problem Kevin Chang Joint work with James Aspnes and Aleksandr Yampolskiy.
1 Near-Optimal Play in a Social Learning Game Ryan Carr, Eric Raboin, Austin Parker, and Dana Nau Department of Computer Science, University of Maryland.
Economics 173 Business Statistics Lecture 6 Fall, 2001 Professor J. Petry
International Environmental Agreements with Uncertain Environmental Damage and Learning Michèle Breton, HEC Montréal Lucia Sbragia, Durham University Game.
Introduction to Matching Theory E. Maskin Jerusalem Summer School in Economic Theory June 2014.
1 Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Lecture 2: two-person non.
Mechanism design. Goal of mechanism design Implementing a social choice function f(u 1, …, u |A| ) using a game Center = “auctioneer” does not know the.
Managerial Effort Incentives and Market Collusion Cécile Aubert University of Bordeaux (GREThA) and Toulouse School of Economics (LERNA) ACLE 2009.
Statistics for Managers Using Microsoft Excel, 4e © 2004 Prentice-Hall, Inc. Chap 8-1 Chapter 8 Fundamentals of Hypothesis Testing: One-Sample Tests Statistics.
Incentives for Sharing in Peer-to-Peer Networks By Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, Mark Lillibridge.
© 2010 Institute of Information Management National Chiao Tung University Chapter 7 Incentive Mechanism Principle-Agent Problem Production with Teams Competition.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Chap 8-1 Chapter 8 Confidence Interval Estimation Statistics for Managers Using Microsoft Excel 7 th Edition, Global Edition Copyright ©2014 Pearson Education.
Intermediation, Compensation and Tacit Collusion in Insurance Markets Andreas Richter Ludwig-Maximilians-University Muinch Jörg Schiller WHU – Otto Beisheim.
Institute of Physics Wroclaw University of Technology 28/09/2005 How can statistical mechanics contribute to social sciences? Piotr Magnuszewski, Andrzej.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Pricing of Competing Products BI Solutions December
Adverse Selection. What Is Adverse Selection Adverse selection in health insurance exists when you know more about your likely use of health services.
Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Statistics for Business and Economics 8 th Edition Chapter 9 Hypothesis Testing: Single.
©The McGraw-Hill Companies, Inc. 2008McGraw-Hill/Irwin Estimation and Confidence Intervals Chapter 9.
Chapter 9 Hypothesis Testing: Single Population
Presentation transcript:

Enforcing Truthful-Rating Equilibria in Electronic Marketplaces T. G. Papaioannou and G. D. Stamoulis Networks Economics & Services Lab, Dept.of Informatics, Athens Univ. of Economics & Business (AUEB) “ Towards a Science of Networks” Workshop Sounion, Greece – September 1, 2006 Work partly funded by EuroNGI Network of Excellence (IST )

2 Overview Problem definition and related work The basic model and its analysis fixed punishments The extended model and its analysis reputation-based punishments Conclusions – Recent and Future Work

3 Reputation in Peer-to-Peer Systems Reputation reveals hidden information about peers Is only effective with reputation-based policies [1] “Provider Selection” and “Contention Resolution” policies But, reputation is vulnerable to false/malicious ratings  Collect ratings on each transaction from both parties and punish both in case of disagreement [2] At least one of them is lying Punishment is not monetary  bans participation for some time [1] “Reputation-based policies that provide the right incentives in peer-to-peer environments”, Computer Networks, vol. 50, no. 4, March [2] “An Incentives' Mechanism Promoting Truthful Feedback in Peer-to-Peer Systems”, GP2PC’05.

4 The New Context Reputation is now studied in electronic marketplaces where participants act both as providers and as clients competitively, so as to maximize their market share Applications: exchanging of vinyl records among collectors, software modules among programmers, news among agencies, etc. Provider selection is based on reputation Malicious rating offers future competitive advantage

5 Objective & Contribution Objective: Provide incentives for truthful ratings by participants in the new context Contribution: Analyzed the dynamics of fixed monetary punishments Derived necessary conditions for stable truthful rating equilibrium Customized punishments w.r.t. reputation to limit social unfairness

6 Related Work: Monetary-Penalty Approaches Miller, Resnick, Zeckhauser: Truthful rating is a Nash equilibrium for clients if certain penalties are imposed to them upon evidence of lying Jurca, Faltings: Side-payments imposed upon evidence of lying. Clients are truthful and do not act as providers Dellarocas: Penalty to provider to compensate payoff gains from offering lower quality than promised. Nash equilibrium for truthful clients

7 Innovation in this Research Dual role of participants Reputation-based competition and its impact on incentives for reporting truthful ratings Stability analysis of truthful-rating Nash equilibrium enforced by each mechanism Tailored reputation-based punishments

8 The Basic Model

9 Providers and Clients E-marketplace with N participants N is either fixed or mean number of participants with geometrically distributed lifetimes Time is partitioned in rounds During a round: Each participant acts: –either as a provider  with probability q –or as a client  with probability 1-q One client is selected at random to be served

10 Selecting a Provider Reputation-based policy: A clients selects the provider to associate with in a probabilistically fair manner w.r.t. the reputation of the latter A provider i is selected during a round with probability proportional to his rank Each participant has a probability a i to provide a service instance successfully, with satisfactory quality a i is private information, estimated by reputation –e.g. percentage of past successful provisions

11 Costs, Payments, Ratings A successfully provided service instance: Offers fixed utility u to the client Demands costly effort v by the provider Costs b to the client A pre-payment p·b is paid for each service to balance the risks Both transacted parties submit a binary rating of the service provided Upon agreement, the client pays (1-p)·b and the vote is registered for updating the provider’s reputation Upon disagreement a fixed punishment c is imposed to both

12 Single-Transaction Game Two sub-games depending on the outcome of the service provision: success or failure Set of Reporting strategies: S = {Witness, Lie, Duck} Impact of agreed rating to future payoffs of participants A positive rating results in payoff impact w p > 0 for the provider and -w c < 0 for the client A negative rating results in payoff impact -w p 0 for the client Payoff impacts are taken independent of current reputation ~ ~

u-b-w c b-v+w p u-p·b-c p·b-v-c u-p·b-c p·b-v-c u-b-c b-v-c u-p·b+w c ’ p·b-v-w p ’ u-p·b-c p·b-v-c u-b-c b-v-c u-p·b-c p·b-v-c u-p·b p·b-v -p·b+w c ’ p·b-w p ’ -p·b-c p·b-c -p·b-c p·b-c -p·b-c p·b-c -p·b-w c p·b+w p -p·b-c p·b-c -p·b-c p·b-c -p·b-c p·b-c -p·b p·b client provider success failure aiai 1-a i Witness Lie Duck Witness Lie Duck ~ ~ ~ ~

14 Truthful-Rating Equilibrium under the Basic Model

15 Truthful Nash Equilibrium Derive conditions for disagreement punishment c so that truthful rating is a Nash equilibrium in both sub- games Disagreement may rationally arise only in two cases Success: provider  Witness and client  Lie or Duck Failure: client  Witness and provider  Lie or Duck Witness is best response to itself when c > (1-p)·b+w c and c > w p Does this equilibrium indeed arise ? Is it stable ? ~

16 Evolutionary Stability Evolutionary Stable Strategy (ESS): 1. Nash equilibrium 2. Is a better reply to any mutant strategy than the latter is to itself Strict Nash equilibrium of the asymmetric game  ESS of its symmetric version Evolutionary dynamics for strategy s with payoff π s played by a population fraction x s :

17 Stable Truthful Rating (x 1, x 2, x 3 ) are the population fractions of providers that play Witness, Lie, Duck in the success sub-game (y 1, y 2, y 3 ) are these fractions for clients Basin of attraction of truthful-rating equilibrium:  Region for population mix that ultimately leads all participants to play Witness  (x 1, x 2, x 3 ) = (1,0,0) and (y 1, y 2, y 3 ) = (1,0,0)

18 The Basin of Attraction of Truthful Rating Success sub-game X  Y

19 The Basin of Attraction of Truthful Rating Failure sub-game X’  Y ’

20 The Extended Model

21 Differences from Basic Model Disagreement punishment is not fixed Depends on the transacted participant’s: –Rank, i.e. reputation –Role which are public information Payoff impacts of a vote w p, -w c, w p, -w c are not taken fixed Calculated explicitly ~~

22 Innovative Reputation Metric Beta reputation metric: Results to time-dependent impact of a single vote to rank values of transacted parties  Solution: An innovative reputation metric Still provides the right incentives Now, rank impacts are not time-dependent; e.g.

23 Reputation-based Punishments Derived conditions for disagreement punishments that enforce the truthful-rating equilibrium Outline of Proof  Necessary and sufficient condition: A single-round deviation from truthful rating at round t is not beneficial.

24 Some Algebra Expected payoff for a participant i at round t : After a non-truthful rating at round t, future ranks of participant i are Calculated explicitly, separately for provider and for client ranksuccess probability mean success probability  payoff as client  payoff as provider

25 The Conditions on Punishments Provider’s punishment: Client’s punishment: Since N is large, f p is approximated by a simple formula This is bounded from above and below

26 Numerical Example N=50, q=0.4, p=0.2, b=2, u=2.5, v=0.5,  =0.6,  =0.9 R Disagreement Payoff Impact w p (R), w c (R) Provider Client Punishment for Disagreement R ~

27 Social Benefit Estimation

28 Social Loss Disagreement punishment is unfairly induced to one of the transacted participants  social loss When punishment is fixed, c > q w p + (1-q)[(1-p)b+w c ] The maximum payoff impacts w p, w c have to be assumed Thus, unfairness is induced for all the non-highest ranked participants  greater social loss Reputation-based punishments eliminate this unfairness! ~ ~

29 Numerical Example Normal distribution of ranks with (μ, σ)=(1, 0.5) Social benefit: Ratio of average reputation-based punishment over fixed punishment for various mean-reputation values of the population Population’s mean-reputation Reputation-based Punishment Fixed Punishment

30 Concluding Remarks

31 Summary of our Contribution Proposed a simple mechanism that provides incentives for truthful rating in an interesting context of an e-marketplace Reputation-based competition Dual role of participants Derived conditions on the effectiveness of such a mechanism with fixed punishments Stability analysis of truthful-rating Nash equilibrium Derived tailored reputation-based punishments Significant reduction of social loss

32 Recent and Future Work Employ different fixed punishments for provider and client Consider the success probability of each participant as a strategic parameter, rather than as being fixed Derive upper bound for the social loss reduction with reputation-based disagreement punishments Explore stability conditions for truthful equilibrium with reputation-based disagreement punishments