Arbitrage in Combinatorial Exchanges Andrew Gilpin and Tuomas Sandholm Carnegie Mellon University Computer Science Department.

Slides:



Advertisements
Similar presentations
Combinatorial Auction
Advertisements

Testing Linear Pricing Algorithms for use in Ascending Combinatorial Auctions (A5) Giro Cavallo David Johnson Emrah Kostem.
Algorithmic mechanism design Vincent Conitzer
Approximating optimal combinatorial auctions for complements using restricted welfare maximization Pingzhong Tang and Tuomas Sandholm Computer Science.
Mechanism Design, Machine Learning, and Pricing Problems Maria-Florina Balcan.
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Combinatorial auctions Vincent Conitzer v( ) = $500 v( ) = $700.
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.
Multiagent Coordination Using a Distributed Combinatorial Auction Jose M. Vidal University of South Carolina AAAI Workshop on Auction Mechanisms for Robot.
Competitive Auctions Review Rattapon Limprasittiporn.
Preference Elicitation Partial-revelation VCG mechanism for Combinatorial Auctions and Eliciting Non-price Preferences in Combinatorial Auctions.
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
Fundamentals of Markets © 2011 D. Kirschen and the University of Washington 1.
Side Constraints and Non-Price Attributes in Markets Tuomas Sandholm Carnegie Mellon University Computer Science Department [Paper by Sandholm & Suri 2001]
Bidding and Allocation in Combinatorial Auctions Noam Nisan Institute of Computer Science Hebrew University.
6.853: Topics in Algorithmic Game Theory Fall 2011 Matt Weinberg Lecture 24.
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.
Yang Cai Sep 24, An overview of today’s class Prior-Independent Auctions & Bulow-Klemperer Theorem General Mechanism Design Problems Vickrey-Clarke-Groves.
1 An Analysis for Troubled Assets Reverse Auction Saeed Alaei (University of Maryland-College Park) Azarakhsh Malekian (University of Maryland-College.
Item Pricing for Revenue Maximization in Combinatorial Auctions Maria-Florina Balcan, Carnegie Mellon University Joint with Avrim Blum and Yishay Mansour.
An Algorithm for Automatically Designing Deterministic Mechanisms without Payments Vincent Conitzer and Tuomas Sandholm Computer Science Department Carnegie.
Computational Criticisms of the Revelation Principle Vincent Conitzer, Tuomas Sandholm AMEC V.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Exchanges = markets with many buyers and many sellers Let’s consider a 1-item 1-unit exchange first.
Machine Learning for Mechanism Design and Pricing Problems Avrim Blum Carnegie Mellon University Joint work with Maria-Florina Balcan, Jason Hartline,
Complexity of Mechanism Design Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
CPS Securities & Expressive Securities Markets Vincent Conitzer
Multi-item auctions & exchanges (multiple distinguishable items for sale) Tuomas Sandholm Carnegie Mellon University.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
WECWIS, June 27, 2002 On the Sensitivity of Incremental Algorithms for Combinatorial Auctions Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, Majid Sarrafzadeh.
Consumers, Producers and Market Efficiency Lecture 5 – academic year 2014/15 Introduction to Economics Fabio Landini.
Experiments on combinatorial auctions Only some of the techniques of CABOB deployed in these results.
Collusion and the use of false names Vincent Conitzer
Welfare economics Outline Expressing changes in human well-being (utility) in monetary terms Deciding between monetary measures that are equally theoretically.
Winner Determination in Combinatorial Exchanges Tuomas Sandholm Associate Professor Computer Science Department Carnegie Mellon University and Founder,
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Ch 4 THE THEORY OF PRODUCTION
1 Deterministic Auctions and (In)Competitiveness Proof sketch: Show that for any 1  m  n there exists a bid vector b such that Theorem: Let A f be any.
Combinatorial Auctions ( Bidding and Allocation) Adapted from Noam Nisan.
Automated Design of Multistage Mechanisms Tuomas Sandholm (Carnegie Mellon) Vincent Conitzer (Carnegie Mellon) Craig Boutilier (Toronto)
Preferences Toby Walsh NICTA and UNSW
Combinatorial Auctions with Structured Item Graphs Vincent Conitzer, Jonathan Derryberry, and Tuomas Sandholm Computer Science Department Carnegie Mellon.
Complexity of Determining Nonemptiness of the Core Vincent Conitzer, Tuomas Sandholm Computer Science Department Carnegie Mellon University.
1 Consumer Choice and Demand CHAPTER 6 © 2003 South-Western/Thomson Learning.
4 Chapter Demand and Supply Applications. CHAPTER 4: Demand and Supply Applications 2 of 23 Chapter Outline 4 Demand and Supply Applications The Price.
CPS Preference elicitation/ iterative mechanisms Vincent Conitzer
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
CPS Auctions & Combinatorial Auctions Vincent Conitzer
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Economics 2010 Lecture 9 Markets and efficiency. Competition and Efficiency  The Key Question  Allocative Efficiency  The Invisible Hand  Obstacles.
We’ve seen that competitive markets bring “order” -- price adjusts to balance supply and demand. Any other desirable properties of competitive markets?
Definition and Complexity of Some Basic Metareasoning Problems Vincent Conitzer and Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Combinatorial Auctions with k-wise Dependent Valuations Vincent Conitzer (CMU) Tuomas Sandholm (CMU) Paolo Santi (Pisa) (Some of the results in this paper.
Chapter 4 Consumer and Producer Surplus >> ©2011  Worth Publishers.
مهندسي سيستم‌هاي تجارت الکترونیکی Electronic Commerce System Engineering (ECSE) رشته مهندسي فناوري اطلاعات- گرايش تجارت الکترونیکی دوره کارشناسی ارشد حضوری.
Securities & Expressive Securities Markets
False-name Bids “The effect of false-name bids in combinatorial
Complexity of Determining Nonemptiness of the Core
Failures of the VCG Mechanism in Combinatorial Auctions and Exchanges
Auctions & Combinatorial Auctions
Internet Economics כלכלת האינטרנט
Combinatorial Auctions (Bidding and Allocation)
Auctions & Combinatorial Auctions
Preference elicitation/ iterative mechanisms
CPS 173 Auctions & Combinatorial Auctions
CPS Auctions & Combinatorial Auctions
CPS Auctions & Combinatorial Auctions
Presentation transcript:

Arbitrage in Combinatorial Exchanges Andrew Gilpin and Tuomas Sandholm Carnegie Mellon University Computer Science Department

2 / 22 Combinatorial exchanges Trading mechanism for bundles of items Expressive preferences –Complementarity, substitutability More efficiency compared to traditional exchanges Examples: FCC, BondConnect

3 / 22 Other combinatorial exchange work Clearing problem is NP-complete –Much harder than combinatorial auctions in practice –Reasonable problem sizes solved with MIP and special- purpose algorithms [Sandholm et al] –Still active research area Mechanism design [Parkes, Kalagnanam, Eso] –Designing rules so that exchange achieves various economic and strategic goals Preference elicitation [Smith, Sandholm, Simmons]

4 / 22 Uncovered additional problem: Arbitrage Arbitrage is a risk-free profit opportunity Agents have endowment of money and items, and wish to increase their utility by trading How well can an agent without any endowment do? –Where are the free lunches in combinatorial exchanges?

5 / 22 Related research: Arbitrage in frictional markets Frictional markets [Deng et al] –Assets traded in integer quantities –Max limit on assets traded at a fixed price Many theories of finance assume no arbitrage opportunity But, computing arbitrage opportunities in frictional markets is NP-complete What about combinatorial markets?

6 / 22 Outline Model Existence –Possibility –Impossibility Curtailing arbitrage Detecting arbitraging bids Generating arbitraging bids Side constraints Conclusions

7 / 22 Model M = {1,…,m} items for sale Combinatorial bid is tuple: = demand of item i (negative means supply) = price for bid j (negative means ask) We assume OR bidding language –As we will see later, this is WLOG

8 / 22 Clearing problem Maximize objective f(x) –Surplus, unit volume, trade volume Such that supply meets demand –With no free disposal, supply = demand All 3 x 2 = 6 problems are NP-complete

9 / 22 Arbitraging bids in a combinatorial exchange Arbitrage is a risk-free profit opportunity –So price on bid is negative Agent has no endowment –Bid only demands, no supply

10 / 22 Impossibility of arbitrage Theorem. No arbitrage opportunity in surplus-maximizing combinatorial exchange with free disposal Proof. Suppose there is. Consider allocation without arbitraging bid –Supply still meets demand (arbitraging bid does not supply anything) –Surplus is greater (arbitraging bid has negative price). Contradiction

11 / 22 Possibility of arbitrage in all 5 other settings M = {1, 2} B1 = {(-1,0), -8} (“sell 1, ask $8”) B2 = {(1,-1), 10} (“buy 1, sell 2, pay $10”) –With no free disposal, this does not clear B3 = {(0,1), -1} (“buy 2, ask $1”) –Now the exchange clears Same example works for unit/trade volume maximizing exchanges with & without free disposal

12 / 22 Even in settings where arbitrage is possible, it is not possible in every instance Consider surplus-maximization, no free disposal B1 = {(-1,0),-8} (“sell 1, ask $8”) B2 = {(1,-1),10} (“buy 1, sell 2, pay $10”) B3 = {(0,1), 2} (“buy 2, pay $2”) No arbitrage opportunity exists

13 / 22 Possibility of arbitrage: Summary ObjectiveFree DisposalNo Free Disposal SurplusImpossibleSometimes possible Unit volumeSometimes possible Trade volumeSometimes possible

14 / 22 Curtailing arbitrage opportunities Unit/trade volume-maximizing exchanges ignore prices Consider two bids: –B1 = {(1,0), 5} (“buy 1, pay $5”) –B2 = {(1,0), -5} (“buy 1, ask $5”) In a unit/trade volume-maximizing exchange, these bids are equivalent Can we do something better?

15 / 22 Curtailing arbitrage opportunities… Run original clearing problem first Then, run surplus-maximizing clearing with unit/trade volume constrained to maximum This prevents situation from previous slide from occurring

16 / 22 Detecting arbitraging bids Arbitraging bid can be detected trivially –Simply check for arbitrage conditions Theorem. Determining whether a new arbitrage- attempting bid is in an optimal allocation is NP- complete –even if given the optimal allocation before that bid was submitted –Proof. Via reduction from SUBSET SUM –Good news: Hard for arbitrager to generate-and-test arbitrage-attempting bids

17 / 22 Relationship between feedback to bidders and arbitrage Feedback –NONE –OWN-WINNING-BIDS –ALL-WINNING-BIDS –ALL-BIDS Feedback ALL-BIDS provides enough information to bidders for them to arbitrage

18 / 22 Generating arbitraging bids (for any setting except surplus-maximization with free disposal) If all bids are for integer quantities, arbitrager can simply submit 1-unit 1-item demand bids (of price  ) Otherwise, arbitraging bids can be computed using an optimization (related to clearing problem) –Item quantities are variables –Problem is to find a bid price and demand bundle such that the bid is arbitraging:

19 / 22 Side constraints Recall: Arbitrage impossible in surplus- maximization with free disposal Exchange administrator may place side constraints on the allocation, e.g.: –volume/capacity constraints –min/max winner constraints With certain side constraints, arbitrage becomes possible …

20 / 22 Side constraints: Example Side constraint: Minimum of 3 winners Suppose: –Only two bidders have submitted bids –Without side constraint, exchange clears with surplus S Third bidder could place arbitraging bid with price at least –S Thus, arbitrage possible in a surplus-maximizing CE with free disposal and side constraints

21 / 22 Bidding languages So far we have assumed OR bidding language All results hold for XOR, OR-of-XORs, XOR-of-ORs, OR* –Does not hurt since OR is special case –Does not help since arbitraging bids do not need to express substitutability

22 / 22 Conclusions Studied arbitrage in combinatorial exchanges –Surplus-maximizing, free disposal: Arbitrage impossible –All 5 other settings: Arbitrage sometimes possible Introduced combinatorial exchange mechanism that eliminates particularly undesirable form of arbitrage Arbitraging bids can be detected trivially Determining whether a given arbitrage-attempting bid arbitrages is NP-complete (makes generate-and-test hard) Giving all bids as feedback to bidders supports arbitrage If demand quantities are integers, easy to generate a herd of bids that yields arbitrage –If not, arbitrage is an integer program Side constraints can give rise to arbitrage opportunities even in surplus-maximization with free disposal The usual logical bidding languages do not affect arbitrage possibilities