Designing efficient market pricing mechanisms Volodymyr Kuleshov - - PowerPoint PPT Presentation

designing efficient market pricing mechanisms
SMART_READER_LITE
LIVE PREVIEW

Designing efficient market pricing mechanisms Volodymyr Kuleshov - - PowerPoint PPT Presentation

Designing efficient market pricing mechanisms Volodymyr Kuleshov Gordon Wilfong Department of Mathematics and School of Computer Science, McGill Universty Algorithms Research, Bell Laboratories August 9, 2011 If we could design an economy,


slide-1
SLIDE 1

Designing efficient market pricing mechanisms

Volodymyr Kuleshov Gordon Wilfong

Department of Mathematics and School of Computer Science, McGill Universty Algorithms Research, Bell Laboratories

August 9, 2011

slide-2
SLIDE 2

If we could design an economy, which market rules would result in the most efficient use of resources?

slide-3
SLIDE 3

If we could design a network, which protocols would result in the most efficient use of bandwidth?

slide-4
SLIDE 4

Engineering application in networking

◮ Internet is made up of

smaller independent networks.

◮ They need quality-assured

connectivity to each other.

◮ Network owners are willing

to sell transit.

slide-5
SLIDE 5

Example companies

slide-6
SLIDE 6

Mechanism requirements

◮ Easy enough to use by

actual people

◮ Scalable to large networks ◮ Resistant to selfish

manipulation by users

slide-7
SLIDE 7

We propose a simple, scalable, and provably economically efficient pricing mechanism.

slide-8
SLIDE 8

Mechanism definition

Q consume rs

provide r

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6 0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

slide-9
SLIDE 9

Mechanism definition

Q consume rs

provide r

  • 1. Provider r submits a pricing

function p(f ) = γf

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6 0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

slide-10
SLIDE 10

Mechanism definition

Q consume rs

provide r

  • 1. Provider r submits a pricing

function p(f ) = γf

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

  • 2. User q chooses a rate dq to transmit

d1 d2

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

slide-11
SLIDE 11

Mechanism definition

Q consume rs

provide r

  • 1. Provider r submits a pricing

function p(f ) = γf

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

  • 2. User q chooses a rate dq to transmit

d1 d2

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

  • 3. The provider receives p(

i di)dq

from consumer q.

slide-12
SLIDE 12

A simple interpretation

slide-13
SLIDE 13

A simple interpretation

0.5 1.0 1.5 2.0 2.5 3.0 1 2 3 4 5 6

At equilibrium, price = p(

  • q

dq) = γf

slide-14
SLIDE 14

How do me measure efficiency?

◮ User q has a utility function of the form

Uq(dq) = Vq(dq)

value

− pdq

  • expenses
slide-15
SLIDE 15

How do me measure efficiency?

◮ User q has a utility function of the form

Uq(dq) = Vq(dq)

value

− pdq

  • expenses

◮ The provider’s utility is

Ur(γ) = pf

  • revenue

− C(f )

  • costs
slide-16
SLIDE 16

How do me measure efficiency?

◮ User q has a utility function of the form

Uq(dq) = Vq(dq)

value

− pdq

  • expenses

◮ The provider’s utility is

Ur(γ) = pf

  • revenue

− C(f )

  • costs

◮ The social welfare is the sum of the utilities:

W (d, γ) =

  • q∈Q

Vq(dq)

  • valuations

− C(f )

  • costs
slide-17
SLIDE 17

How do we measure efficiency?

◮ Assume that any user’s action is always the best he/she can

do given what everyone else is doing:

◮ A combination of actions (dNE, γNE) that satisfies this is a

Nash equilibrium.

slide-18
SLIDE 18

How do we measure efficiency?

◮ Assume that any user’s action is always the best he/she can

do given what everyone else is doing:

◮ A combination of actions (dNE, γNE) that satisfies this is a

Nash equilibrium.

◮ We measure efficiency using the price of anarchy:

welfare at worst Nash equilibrium best possible welfare

slide-19
SLIDE 19

The mechanism, again

Q consume rs

provide r

There are two sources of inefficiency.

slide-20
SLIDE 20

Separating demand and supply side inefficiency

Theorem (Johari and Tsitsiklis, 2005)

When supply is fixed, the price of anarchy on the demand side of the market is 2/3.

slide-21
SLIDE 21

Separating demand and supply side inefficiency

Theorem (Johari and Tsitsiklis, 2005)

When supply is fixed, the price of anarchy on the demand side of the market is 2/3.

Lemma

The price of anarchy of the two-sided market equals 2ρ(ρ − 2) ρ − 4 where 0 ≤ ρ ≤ 1 is an overcharging parameter.

slide-22
SLIDE 22

Separating demand and supply side inefficiency

Lemma

The worst efficiency occurs with marginal cost functions are linear: c(f ) = βf

slide-23
SLIDE 23

Separating demand and supply side inefficiency

Lemma

The worst efficiency occurs with marginal cost functions are linear: c(f ) = βf

Lemma

For these cost functions, the overcharging parameter equals ρ = β γ where γ is the slope of p(f ) = γf (the pricing function).

slide-24
SLIDE 24

Elasticity of demand

Definition

The elasticity of the flow f with respect to γ is defined to be ǫ = %∆f %∆γ = percentage change of f percentage change of γ

slide-25
SLIDE 25

Elasticity of demand

Definition

The elasticity of the flow f with respect to γ is defined to be ǫ = %∆f %∆γ = percentage change of f percentage change of γ

Lemma

At equilibrium, the overcharging parameter equals ρ = 2 − 1 ǫ

slide-26
SLIDE 26

Results for one link: user demand

Proposition

When consumer valuations are monomials of degree d: Vq(f ) = aqf d then ρ = d and the price of anarchy is 2d(2 − d) 4 − d

slide-27
SLIDE 27

Results for one link: supplier competition

Theorem

Suppose there are at least 3 producers. Then the price of anarchy is bounded by a constant.

slide-28
SLIDE 28

Results for one link: supplier competition

Theorem

Suppose there are at least 3 producers. Then the price of anarchy is bounded by a constant.

Theorem

When the number of providers R → ∞, ρ → 1 and the price of anarchy goes to 2/3.

slide-29
SLIDE 29

Markets over general graphs

Q users

R providers

s1 t1

s2 t2 (s1,t1)

(s2,t2)

◮ Each user owns a pair of

nodes (sq, tq).

◮ Users buy capacities on

edges using a single-resource market at each edge.

◮ They value the flow they

send in the capacitated graph.

slide-30
SLIDE 30

Case 1: Route graph

slide-31
SLIDE 31

Case 1: Route graph

Theorem

Let G be a route with L links and two providers per link. Assume that valuations are linear.

  • 1. When L < ∞, ρ is strictly positive.
  • 2. As L → ∞, ρ → 0.
slide-32
SLIDE 32

Case 1: Route graph

Theorem

Let G be a route with L links and two providers per link. Assume that valuations are linear.

  • 1. When L < ∞, ρ is strictly positive.
  • 2. As L → ∞, ρ → 0.

Theorem

Let G be a route with L links and at least three providers per

  • link. Then ρ is always strictly positive
slide-33
SLIDE 33

Case 1: Route graph, provider competition

Theorem

Let G be a route with L links and R providers per link. As R → ∞, ρ → 1, and the price of anarchy tends to 2/3.

slide-34
SLIDE 34

Case 2: Series-parallel graph

◮ The price of anarchy in a parallel-serial graphs is

bounded by that of a path.

◮ As the number of paths increases, the effective demand

becomes elastic.

slide-35
SLIDE 35

Case 3: Arbitrary graph

Theorem

Let G an arbitrary graph.

◮ When there are at least 3

providers on every link, the price

  • f anarchy is non-zero.

◮ As the number of providers goes

to infinity ρ → 1, and the price

  • f anarchy goes to 2/3.
slide-36
SLIDE 36

Conclusion

In this work we,

◮ Analyzed a form of pricing that can be deployed in practice. ◮ Proved that natural pricing rules can be nearly efficient,

extending existing theoretical results.

◮ Showed how horizontal and vertical competition affect

economic efficiency.

slide-37
SLIDE 37

Conclusion

In this work we,

◮ Analyzed a form of pricing that can be deployed in practice. ◮ Proved that natural pricing rules can be nearly efficient,

extending existing theoretical results.

◮ Showed how horizontal and vertical competition affect

economic efficiency. This can be used to

◮ Guide the design of real-world pricing mechanisms. ◮ Approximately forecast how market features will affect their

performance.