Albert PlaBeatriz López Javier Murillo Multi Criteria Operators for Multi-attribute Auctions University of Girona

Slides:



Advertisements
Similar presentations
Combinatorial Auctions with Complement-Free Bidders – An Overview Speaker: Michael Schapira Based on joint works with Shahar Dobzinski & Noam Nisan.
Advertisements

(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Approximating optimal combinatorial auctions for complements using restricted welfare maximization Pingzhong Tang and Tuomas Sandholm Computer Science.
Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.
CPS Bayesian games and their use in auctions Vincent Conitzer
USING LOTTERIES TO APPROXIMATE THE OPTIMAL REVENUE Paul W. GoldbergUniversity of Liverpool Carmine VentreTeesside University.
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Computer-aided mechanism design Ye Fang, Swarat Chaudhuri, Moshe Vardi 1.
Fast Algorithms For Hierarchical Range Histogram Constructions
Adam Arsenault Department of Agricultural Economics University of Saskatchewan UNIVERSITY OF SASKATCHEWAN Saskatoon, Saskatchewan, Canada.
Intermediate Microeconomics Midterm (50%) (4/27) Final (50%) (6/22) Term grades based on relative ranking. Mon 1:30-2:00 ( 社科 757)
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Federal Communications Commission NSMA Spectrum Management Conference May 20, 2008 Market Based Forces and the Radio Spectrum By Mark Bykowsky, Kenneth.
Do software agents know what they talk about? Agents and Ontology dr. Patrick De Causmaecker, Nottingham, March
Workflow Resource Allocation through Auctions Abert Plà eXiT – University of Girona Advisors: Beatriz López & Javier Murillo 1.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
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.
Mechanism Design and the VCG mechanism The concept of a “mechanism”. A general (abstract) solution for welfare maximization: the VCG mechanism. –This is.
Reducing Costly Information Acquisition in Auctions Kate Larson, University of Waterloo Presented by David Thompson, University of British Columbia July.
Distributed Multiagent Resource Allocation In Diminishing Marginal Return Domains Yoram Bachrach(Hebew University) Jeffrey S. Rosenschein (Hebrew University)
Limitations of VCG-Based Mechanisms Shahar Dobzinski Joint work with Noam Nisan.
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
A Multicriteria Model for Electronic Auctions Marie-Jo Bellosta, Im`ene Brigui Sylvie Kornman Daniel Vanderpooten Presented By Guoliang Qian.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
SECOND PART: Algorithmic Mechanism Design. Mechanism Design MD is a subfield of economic theory It has a engineering perspective Designs economic mechanisms.
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.
Trust Based Mechanism Design By Rajdeep Dash, Gopal Ramchurn, Nicholas Jennings.
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.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Truthfulness and Approximation Kevin Lacker. Combinatorial Auctions Goals – Economically efficient – Computationally efficient Problems – Vickrey auction.
This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.
Collusion and the use of false names Vincent Conitzer
Aspects of E-Science, Mathematics and Theoretical Computer Science Professor Iain Stewart Department of Computer Science University of Durham March 2003.
UT DALLAS Erik Jonsson School of Engineering & Computer Science FEARLESS engineering Incentive compatible Assured Data Sharing & Mining Murat Kantarcioglu.
CPS 173 Mechanism design Vincent Conitzer
Multi-Unit Auctions with Budget Limits Shahar Dobzinski, Ron Lavi, and Noam Nisan.
Buying Behavior and the Buying Process  What are the different types of customers?  How do organizations make purchase decisions?  Which factors do.
By Scott Kominers And Lukens Orthwein.  Computational Complexity  Eliminating “Bad” Equilibria  Unsophisticated Buyers  Lazy Participants.
An Online Procurement Auction for Power Demand Response in Storage-Assisted Smart Grids Ruiting Zhou †, Zongpeng Li †, Chuan Wu ‡ † University of Calgary.
Combinatorial Auctions By: Shai Roitman
Resource mediation internals The mediator can decide which resource provider(s) to allocate for a resource request This can be based on  resource cost.
Workflow Resource Allocation through Auctions Universitat de Girona Albert Plà, Beatriz López, Javier Murillo eXiT 16/7/ AILOG Barcelona Universitat.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
MAP: Multi-Auctioneer Progressive Auction in Dynamic Spectrum Access Lin Gao, Youyun Xu, Xinbing Wang Shanghai Jiaotong University.
Chapter 4 Bayesian Approximation By: Yotam Eliraz & Gilad Shohat Based on Chapter 4 on Jason Hartline’s book Seminar in Auctions and Mechanism.
Strategyproof Auctions For Balancing Social Welfare and Fairness in Secondary Spectrum Markets Ajay Gopinathan, Zongpeng Li University of Calgary Chuan.
A Study of Central Auction Based Wholesale Electricity Markets S. Ceppi and N. Gatti.
© 2010 Institute of Information Management National Chiao Tung University Chapter 7 Incentive Mechanism Principle-Agent Problem Production with Teams Competition.
Promoting Gas-Interconnector Investment - Insights from Laboratory Experiments Bastian Henze Tilburg University, CentER & TILEC GRI Workshop Stockholm,
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.
Algorithmic Mechanism Design Shuchi Chawla 11/7/2001.
Reconstructing Preferences from Opaque Transactions Avrim Blum Carnegie Mellon University Joint work with Yishay Mansour (Tel-Aviv) and Jamie Morgenstern.
Multi-Agents System CMSC 691B Gunjan Kalra Peter DSouza.
Analysis Manager Training Module
False-name Bids “The effect of false-name bids in combinatorial
Generalized Agent-mediated procurement auctions
CPS Mechanism design Michael Albert and Vincent Conitzer
Auctions and Competitive Bidding
Internet Economics כלכלת האינטרנט
Pricing Model In Cloud Computing
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Auction Theory תכנון מכרזים ומכירות פומביות
EXiT PETRI NET BASED AGENTS FOR COORDINATING RESOURCES IN A WORKFLOWMANAGEMENT SYSTEM Universitat de Girona ICAART 2011 – Rome.
Presentation transcript:

Albert PlaBeatriz López Javier Murillo Multi Criteria Operators for Multi-attribute Auctions University of Girona University of Girona Newronia

2/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Index  Introduction – Domain – Auctions  Auctions – Basic Concepts – Multi-Attribute Auctions  Multi-Criteria Methods in Multi-Attribute Auctions – Requirements – Examples  Experimentation  Conclusions

3/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Introduction  Special domains: – Production not known in advance – Production under demand – Unknown resource status – Outsourced resources – Resource allocation in real time Managers expect low price, high speed and high quality VS Resource providers want to maximize benefits and occupation Domain Auctions

4/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  Example – Medical device maintenance service in a hospital Fault Reparation Internal technicians Outsourcing technicians Provider 1Provider 2Provider n … ? Domain Auctions Introduction

5/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  Auctions: – Allocate resources in a competitive market – Optimize outcome of the participants Resource Agent 1 Resource Agent 2 Workflow Agent A Resource Type A AUCTION! Domain Auctions Introduction

6/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  Multi-Attribute Auctions: – Each bid is characterized by a set of attributes in addition to price: Time Quality Energy … – Attribute aggregation can be done using multi-criteria functions. – How should be the multi-criteria aggregator? Domain Auctions Introduction

7/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Auctions  Auctions – Utility: is the measurement of the satisfaction received by the participants of an auction.U (B i ) – Value: is the score or the price which participants assign to a certain bid. It can be defined using an Evaluation Function V (B i ) – Winner determination problem (WDP) is the problem to compute the winner bid that maximizes the auctioneer’s utility. – The payment mechanism is the process of deciding which is the price p and payout for the auctioneers and the bidders.  Desirable property: – Incentive compatible mechanism: the auction mechanism must encourage bidders to reveal their real attributes. This means that bidders obtain a better profit by revealing their real attributes than by cheating. Example: Vickrey auction: The winner pays the price of the second-highest bid. Simple Auctions Multi-attribute auctions

8/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Auctions  Multi-attribute auctions (MAA) – Each Bid B is composed by its cost b and a set of attributes AT=(at 1,…, at n ).B=(b,AT) – WDP: Find the optimal Bid according to cost b and attributes AT Evaluation function V(b i,AT i ) depends on the auctioneers goal The winner is determined by: argmax(V(b i,AT i )) Simple Auctions Multi-attribute auctions

9/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Auctions  Second price Multi-attribute auctions – The winner pays the second highest-bid price. But… What is a second price in MAA? – The winner must provide the attributes in such a way that the evaluation is, at least, as good as in the second best bid: V(b 1 v,AT 1 v ) ≥ V(b 2,AT 2 ) Simple Auctions Multi-attribute auctions [5] Che. Y,K. Design competition through multidimensional auctions

10/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Auctions  Second price Multi-attribute auctions – If we assume that the winner will provide AT 1 (AT 1 =AT 1 v ) then the payment is the following: V(p,AT 1 ) = V(b 2,AT 2 ) p = V’(V(b 2,AT 2 ), AT 1 ) Where V’(x,AT) = b is the anti-function of V(b,AT) = x Simple Auctions Multi-attribute auctions [17] Pla et al. Multi-Attribute Auction Mechanism for Supporting Resource Allocation in Business Process Enactment b 1, AT 1 Best Bid AT 1 v Delivered Item b 2, AT 2 2 nd Best Bid

11/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Auctions  Second price Multi-attribute auctions – To prevent cheating on the attributes level, if a bidder provide a different attributes than AT 1 (AT 1 ≠AT 1 v ) the payment is: V(p,AT 1 v ) = V(b 1,AT 1 ) p = V’(V(b 1,AT 1 ), AT 1 v ) Simple Auctions Multi-attribute auctions [17] Pla et al. Multi-Attribute Auction Mechanism for Supporting Resource Allocation in Business Process Enactment b 1, AT 1 Best Bid AT 1 v Delivered Item b 2, AT 2 2 nd Best Bid

12/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Auctions  Second price Multi-attribute auctions (MAA) – To summarize… Payment: Simple Auctions Multi-attribute auctions

13/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Multi Criteria Methods in MAA  Multicriteria Function as Evaluation Function – Requirements for a Multi Criteria Function to be used as evaluation function V(b,AT) Real Valued Function Monotonicity Bijection RequirementsExamples

14/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Multi Criteria Methods in MAA  Real Valued Function – V(b,AT) must return a real number evaluation for each bid The payment mechanism involves the score obtained by the second best bid. – Discards MCM which result in ranked lists or orders without a score. If there is not a score or evaluation, the payment cannot be computed. RequirementsExamples

15/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Multi Criteria Methods in MAA  Monotoniciy – If an attribute is improved, the score of the evaluation must also improve. – Ensures that, for every possible value in the attribute domain, V(b,AT) will return a value. – Only applied in the range of values an attribute can take. E.g.:If an attribute can only take positive values (time duration), it can be evaluated using its square. RequirementsExamples Domain for the time attribute

16/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Multi Criteria Methods in MAA  Bijection – In order to calculate the payment, V(b,AT) must have a bijective behavior regarding the price attribute. – In other words, given: V(b,AT) = x its antifunction will be V’(x,AT) = bwhere b can be just one value RequirementsExamples

17/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Multi Criteria Methods in MAA  Examples – Product – Weighted Sum RequirementsExamples *Assuming assuming that all attributes belong to the real numbers domain and are normalized – Mathematical Norms: E.g. Euclidean norm – Favors bids with more balanced attributes – Attribute domain: positive numbers plus 0 Not all the norms can be used: e.g. Chebyshev norm cannot be used as V(B) since it is not bijective

18/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Multi Criteria Methods in MAA  Weighted Sum of Functions – Attributes utility computed individually using a function f j (x) – Results are then aggregated using a weighted sum – Highly adaptable to the domain – All f j (x) must commit the requirements previously presented RequirementsExamples

19/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Experimentation  Multi-Agent Business Process Simulation

20/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Experimentation  Simulation – 3 different concurrent Business Processes composed by 6 different tasks. – Each task has an estimated duration between 10 and 15 minutes and requires one resource of a certain type (A to D) to be executed. – There are 4 (A to D) types of resources provided by 8 Resource providers. – Each Resource Provider can perform 3 types of tasks with different qualifications (Type, time, error tolerance) – Repeated using Product, Weighted Sum and Euclidean Norm as Evaluation function (100 executions each) Unbalanced Attributes Balanced Attributes Truthful bidding strategyCheating

21/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  Results Wf Mean Economic CostWf Mean Error ToleranceWF Mean Service time V(b,AT) V(b,AT) V(b,AT) € % minutes Experimentation

22/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  Results Experimentation Benefits (€) Euclidean norm favours balanced bidders Unbalanced Attributes Balanced Attributes

23/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  Results Experimentation Benefits (€) Cheaters obtain less benefits than honest bidders

24/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012  This paper treated the problem of allocation resources in a decentralized environment where production agenda is unknwon: Multi Attribute Auctions (MAA)  Defined the properties of the MAA evaluation function: – Monotonicity – Real Valued function – Bijective (regarding the economic attribute)  Examples: Weighted sum, mathematical norms, weighted sum of functions…  Shown how the evaluation function conditions the behavior of the auction Conclusions

Albert PlaBeatriz López Javier Murillo Multi Criteria Operators for Multi-attribute Auctions University of Girona University of Girona Newronia

26/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012

27/24MDAI2012 – Multi Criteria Operators for Multi-Atrribute Auctions21/11/2012 Introduction Dynamism Decentralization Third Party Oustourcing Contingency Robustness Customer Orientation Providers Privacy Process Planing: + Uncertainity + Complexity Business process Many concurrent executions Domain Auctions