Blind Portfolio Auctions via Intermediaries

Similar documents
We examine the impact of risk aversion on bidding behavior in first-price auctions.

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

Microeconomic Theory II Preliminary Examination Solutions

Problem Set 3: Suggested Solutions

Microeconomics Comprehensive Exam

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information

Microeconomic Theory III Spring 2009

All Equilibrium Revenues in Buy Price Auctions

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Simon Fraser University Spring 2014

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

Bayesian games and their use in auctions. Vincent Conitzer

Auction. Li Zhao, SJTU. Spring, Li Zhao Auction 1 / 35

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?

Homework # 8 - [Due on Wednesday November 1st, 2017]

Chapter 3. Dynamic discrete games and auctions: an introduction

HW Consider the following game:

Auctions: Types and Equilibriums

Up till now, we ve mostly been analyzing auctions under the following assumptions:

Revenue Equivalence and Income Taxation

Problem Set 3: Suggested Solutions

Socially-Optimal Design of Crowdsourcing Platforms with Reputation Update Errors

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Auction Theory: Some Basics

KIER DISCUSSION PAPER SERIES

Strategy -1- Strategic equilibrium in auctions

Budget Management In GSP (2018)

General Examination in Microeconomic Theory SPRING 2014

UCLA Department of Economics Ph.D. Preliminary Exam Industrial Organization Field Exam (Spring 2010) Use SEPARATE booklets to answer each question

Practice Problems 2: Asymmetric Information

Mechanism Design and Auctions

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2017

Empirical Tests of Information Aggregation

Strategy -1- Strategy

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

ECO 426 (Market Design) - Lecture 8

On Existence of Equilibria. Bayesian Allocation-Mechanisms

Advanced Microeconomics

Auction is a commonly used way of allocating indivisible

CS 573: Algorithmic Game Theory Lecture date: March 26th, 2008

Approximate Revenue Maximization with Multiple Items

Game Theory Lecture #16

Auctions That Implement Efficient Investments

AUCTIONEER ESTIMATES AND CREDULOUS BUYERS REVISITED. November Preliminary, comments welcome.

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1

Auctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills.

Models and Decision with Financial Applications UNIT 1: Elements of Decision under Uncertainty

Sequential-move games with Nature s moves.

Commitment in First-price Auctions

Experiments on Auctions

Microeconomics II. CIDE, MsC Economics. List of Problems

Directed Search and the Futility of Cheap Talk

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding

University of Hong Kong

Topics in Contract Theory Lecture 6. Separation of Ownership and Control

Parkes Auction Theory 1. Auction Theory. Jacomo Corbo. School of Engineering and Applied Science, Harvard University

B. Online Appendix. where ɛ may be arbitrarily chosen to satisfy 0 < ɛ < s 1 and s 1 is defined in (B1). This can be rewritten as

Financial Fragility A Global-Games Approach Itay Goldstein Wharton School, University of Pennsylvania

Notes for Section: Week 7

From Discrete Time to Continuous Time Modeling

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints.

Econ 618 Simultaneous Move Bayesian Games

PhD Qualifier Examination

Consumption and Asset Pricing

Noncooperative Market Games in Normal Form

Revenue Equivalence and Mechanism Design

MA300.2 Game Theory 2005, LSE

Optimal Mixed Spectrum Auction

Sequential Auctions, Price Trends, and Risk Preferences

PhD Qualifier Examination

EconS Games with Incomplete Information II and Auction Theory

Economics 101A (Lecture 21) Stefano DellaVigna

Homework 2: Dynamic Moral Hazard

Effects of Wealth and Its Distribution on the Moral Hazard Problem

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016

Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition

Dynamic Pricing in Ridesharing Platforms

2.4 Industrial implementation: KMV model. Expected default frequency

EXTRA PROBLEMS. and. a b c d

Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017

Econ 2230: Public Economics. Lecture 15: Fundraising: Lotteries

PAULI MURTO, ANDREY ZHUKOV

Auction theory. Filip An. U.U.D.M. Project Report 2018:35. Department of Mathematics Uppsala University

Right to choose in oral auctions

Appendix: Common Currencies vs. Monetary Independence

ECO 426 (Market Design) - Lecture 11

Comparative Cheap Talk

Collective bargaining, firm heterogeneity and unemployment

Topics in Contract Theory Lecture 5. Property Rights Theory. The key question we are staring from is: What are ownership/property rights?

Practice Problems. w U(w, e) = p w e 2,

Revenue Equivalence Theorem (RET)

by open ascending bid ("English") auction Auctioneer raises asking price until all but one bidder drops out

Web Appendix: Proofs and extensions.

Consider the following (true) preference orderings of 4 agents on 4 candidates.

ECON106P: Pricing and Strategy

Optimal selling rules for repeated transactions.

ECON Microeconomics II IRYNA DUDNYK. Auctions.

Transcription:

Blind Portfolio Auctions via Intermediaries Michael Padilla Stanford University (joint work with Benjamin Van Roy) April 12, 2011 Computer Forum 2011 Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 1 / 18

Program Trading Agency vs. Principal Program Trading: Agency vs. Principal Program trading, the buying/selling of large portfolios, operates in two formats: Agency: Broker executes trades on behalf of the client (VWAP is a common target). All risk is held by the client. Client pays a fixed commission. Principal: Client sells its portfolio to the broker at a mutually agreed upon spot price plus commission. All risk is transferred to the broker. Result of a preliminary blind basket auction. Accounts for roughly 12% of daily shares traded on NYSE (18 billion dollars) daily. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 2 / 18

Program Trading Blind Basket Auction Blind Basket Auction Seller contacts a small number of brokers and provides each with a description of the portfolio s characteristics. Exact identities of names in portfolio are not revealed. Seller decides whether to sell entire portfolio to broker with best bid. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 3 / 18

Program Trading Blind Basket Auction Inefficiencies There are several areas of inefficiency... 1 The uncertainty about the portfolio s contents reduces the valuations of risk-averse buyers. Due to the blind nature of the bidding process, brokers are concerned about adverse selection effects. 2 It is desirable to solicit bids from a larger number of potential buyers. Due to the information leakage that occurs in the current blind auction mechanism, sellers want to limit their bid solicitation to a very limited number of brokers. 3 The value of the portfolio may be increased through division into parts sold to multiple bidders. It is likely that different pieces of the portfolio are valued more by different brokers. We focus here on items 1 and 2. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 4 / 18

Objective Objective Address points 1 and 2 by introducing an intermediary between the seller and brokers. Goal: To show via a computational study based on a game-theoretic model the significant benefit to seller transaction costs possible if the auction is intermediated. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 5 / 18

Model Model A single risk-neutral seller and N risk-averse bidders. Assumption 1 - Brokers Utilities Brokers exhibit constant absolute risk aversion. In other words, there exists a scalar r > 0 such that u(v) = exp( rv) for all v. The role of private information is central to our problem and arises through the dollar value v n of the portfolio to each broker. Assumption 2 - Brokers Valuations For each n, the value of the portfolio to the nth broker is given by v n = v qθ n, where θ 1,..., θ N are iid random variables independent from q. Further, the seller only observes q and each nth broker only observes θ n. v : nominal portfolio value (common knowledge), q : portfolio characteristic (seller knowledge), θ n : broker type ( F ) (broker knowledge) Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 6 / 18

Mechanisms Standard First-Price Auction Standard First-Price Auction I Given N, r, and v, we assume brokers employ a symmetric strategy β s mapping θ n to a bid β s (θ n ). As a model of broker behavior, we consider a bidding strategy that forms part of a Bayesian-Nash equilibrium. Lemma 1 - Unique Symmetric Bayesian-Nash Bidding Strategy Let Assumptions 1 and 2 hold. There exists a unique symmetric Bayesian-Nash equilibrium bidding function for the standard first-price auction. This bidding function is strictly decreasing in θ and is differentiable. As such, this bidding function β S uniquely satisfies the following expression [ ( ) ] β S (θ n ) argmax E u (v n b)1(b max β S(θ m )) θn. b R m n Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 7 / 18

Mechanisms Standard First-Price Auction Standard First-Price Auction II Solving for this gives us the unique symmetric bidding function. Theorem 1 - B-N Equilibrium Bids in a Standard First-Price Auction Let Assumptions 1 and 2 hold. In a standard first-price auction, the unique symmetric Bayesian-Nash equilibrium bidding function is given by β S (θ n ) = v ce (θ n ) + [1 1 r ln re rvce(θn) ] vce(θn) F ce (v ce (θ n )) N 1 F ce (ρ) N 1 e rρ dρ In fact, this is the only Bayesian-Nash equilibrium... Theorem 2 - Unique Bayesian-Nash Bidding Strategy Let Assumptions 1 and 2 hold. In a standard first-price auction, there exists a unique Bayesian-Nash equilibrium bidding function. 0 Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 8 / 18

Mechanisms Intermediated First-Price Auction Intermediated First-Price Auction Each broker supplies to the intermediary a function β(θ n,, ) of the portfolio parameter q and N. As before, we model broker behavior by a Bayesian-Nash equilibrium bidding function (again unique), i.e. β I (θ n, q, N) argmax E b R [ u ( (v n b)1(b max m n β I (θ m, q, N)) This leads us to the associated bidding strategy... ) θn, q, N]. Theorem 3 - B-N Equilibrium Bids in an Intermediated First-Price Auction Let Assumptions 1 and 2 hold. In an intermediated first-price auction, the unique Bayesian-Nash equilibrium bidding function is given by [ β I (θ n, q, N) = v(θ n ) + 1 ] v(θn) r ln 1 re rv(θn) F v (v(θ n )) N 1 F v (ρ) N 1 e rρ dρ 0 Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 9 / 18

Computational Study Computational Study - Metric & Representative Values We compared via Monte-Carlo the relative performance of standard and intermediated mechanisms regarding seller transaction cost, i.e. T = v b w, where b w is the winning bid. This is the difference between the portfolio s book value and what they actually receive for it. Values: v = 5 10 8, representing a 500 million dollar portfolio. q unif[0, 10 7 ], and θ n unif[0, 1], representing broker transaction costs of 0 to 10 million dollars. N {2,..., 8}. r [0, 4 10 7 ], capturing a realistic range of risk-aversion parameters (see paper). Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 10 / 18

Results Seller Transaction Costs vs. Risk Results - Seller Transaction Costs vs. Risk Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 11 / 18

Results Summary Results - Summary As r increases, brokers face two opposing pressures: The optimal point where the marginal decrease in expected utility balances the marginal gain in winning probability will occur for a larger optimal bid, i.e. brokers tend to bid more. v ce for each broker decreases and brokers tend to bid less. Degree of risk in portfolio will determine which factor dominates. Gives us the following results: For all r > 0, T (I ) < T (S) and the gap between the two increases with r (e.g. over 10% savings for N = 2). In the standard case, T (S) increases as r increases. In the intermediated case, T (I ) decreases as r increases. Theorem 4 - Transaction Costs Decrease with r with Intermediation (Sketch) Let Assumption 2 hold. If a utility u 2 is strictly more risk averse than another utility u 1, then T (I ) is strictly less if brokers realize utility u 2 than if brokers realize utility u 1. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 12 / 18

Summary and Continuing Work Summary Summary... We have demonstrated via both computational and theoretical results the potential benefit to sellers of intermediation. Under reasonable assumptions of brokers utility functions and investment preferences (see paper), transaction cost improvements of over 10% are realized. The first investigation of how the notion of uncertainty affects blind portfolio auction efficiency. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 13 / 18

Summary and Continuing Work Continuing Work Current extensions of this work... Enhancing broker valuation model to account for the allocative inefficiency seen in practice. Empirical study of information leakage effects, and market efficiency (with C. Giannikos, CUNY). A repeated game-theoretic model to study reputation effects in bidding behavior (with C. Giannikos, CUNY). Consider a model with correlation amongst brokers types. Model/methods to award a portfolio across different brokers. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 14 / 18

Appendix Appendix These next slides illuminate in more detail targeted material from the previous discussion. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 15 / 18

Appendix Theorem 4 : Costs Decrease with r with Intermediation Figure: Two utility functions, the more risk-averse one normalized in the second figure such that u 2 (0) = 0 and u 1 (v β(v)) = u 2 (v β(v)). Here v β(v) = 1 corresponds to the optimal bid β(v) for the less risk-averse utility function. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 16 / 18

Appendix Values for r Consider a broker who is uncertain about what a portfolio is worth to him and assumes a normal distribution with a standard deviation of one million dollars around his expectation. What premium would have to be subtracted from his expectation to arrive at a price where he is indifferent about acquiring the portfolio? A representative figure might be one hundred thousand dollars, which is ten percent of the standard deviation a risk aversion of r = 2 10 7. E.g., letting the broker s profit, which is the difference between the amount he pays for the portfolio and the amount he later discovers it is worth to him, be denoted by x N(10 5, (10 6 ) 2 ), this value of r solves v CE (θ n ) = 1 r ln ( E [ e rx]) = 10 5 r 2 (106 ) 2 = 0. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 17 / 18

Appendix Model to Account for Allocative Inefficiency Here we use v n = v + f (θ n q 1), where θ n unif[ 1, 1], q unif[ 1, 1], and f R +. Results in v n [v 2f, v ]. Other distributions also lead to closed-form solutions. Michael Padilla (Stanford University) Blind Portfolio Auctions via Intermediaries 18 / 18