Maximal Matching for Double Auction
Identifieur interne : 000999 ( Istex/Corpus ); précédent : 000998; suivant : 000A00Maximal Matching for Double Auction
Auteurs : Dengji Zhao ; Dongmo Zhang ; Md Khan ; Laurent PerrusselSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
English descriptors
- KwdEn :
- Algorithm, Atching, Auction, Bidding prices, Compatibility, Double auction, Double auction design, Double auction market, Double auction mechanism, Double auction mechanism design, Experimental results, Extra matchable, Extran umberof, High liquidity, Incentive compatibility, Individual rationality, Last matchable, Liquidity, Liquidity maximization, Long term, Market liquidity, Market model, Market share, Matchable, Maximal, Mechanism design, Multiple buyers, Order output, Recursively check, Same number, Sellers, Social welfare, Sort order, Theoretical results, Total amount, Tournament platform, Trader distribution, Trading agent competition market design, Transaction volume, Uniform price, Worst case.
- Teeft :
- Algorithm, Atching, Auction, Bidding prices, Compatibility, Double auction, Double auction design, Double auction market, Double auction mechanism, Double auction mechanism design, Experimental results, Extra matchable, Extran umberof, High liquidity, Incentive compatibility, Individual rationality, Last matchable, Liquidity, Liquidity maximization, Long term, Market liquidity, Market model, Market share, Matchable, Maximal, Mechanism design, Multiple buyers, Order output, Recursively check, Same number, Sellers, Social welfare, Sort order, Theoretical results, Total amount, Tournament platform, Trader distribution, Trading agent competition market design, Transaction volume, Uniform price, Worst case.
Abstract
Abstract: We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading Agent Competition Market Design) platform, we show with experiments that the new matching method not only increases market liquidity but also significantly improves market share and auctioneer’s profit in the long term, compared with equilibrium matching, the most commonly used matching method.
Url:
DOI: 10.1007/978-3-642-17432-2_52
Links to Exploration step
ISTEX:35F48BDB366863B55A7522498C82BC13EEAE0CA2Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Maximal Matching for Double Auction</title><author><name sortKey="Zhao, Dengji" sort="Zhao, Dengji" uniqKey="Zhao D" first="Dengji" last="Zhao">Dengji Zhao</name><affiliation><mods:affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>IRIT, University of Toulouse, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: dzhao@scm.uws.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Zhang, Dongmo" sort="Zhang, Dongmo" uniqKey="Zhang D" first="Dongmo" last="Zhang">Dongmo Zhang</name><affiliation><mods:affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: dongmo@scm.uws.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Khan, Md" sort="Khan, Md" uniqKey="Khan M" first="Md" last="Khan">Md Khan</name><affiliation><mods:affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: md.khan@scm.uws.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Perrussel, Laurent" sort="Perrussel, Laurent" uniqKey="Perrussel L" first="Laurent" last="Perrussel">Laurent Perrussel</name><affiliation><mods:affiliation>IRIT, University of Toulouse, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: laurent.perrussel@univ-tlse1.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:35F48BDB366863B55A7522498C82BC13EEAE0CA2</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-17432-2_52</idno><idno type="url">https://api.istex.fr/document/35F48BDB366863B55A7522498C82BC13EEAE0CA2/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000999</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000999</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Maximal Matching for Double Auction</title><author><name sortKey="Zhao, Dengji" sort="Zhao, Dengji" uniqKey="Zhao D" first="Dengji" last="Zhao">Dengji Zhao</name><affiliation><mods:affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>IRIT, University of Toulouse, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: dzhao@scm.uws.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Zhang, Dongmo" sort="Zhang, Dongmo" uniqKey="Zhang D" first="Dongmo" last="Zhang">Dongmo Zhang</name><affiliation><mods:affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: dongmo@scm.uws.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Khan, Md" sort="Khan, Md" uniqKey="Khan M" first="Md" last="Khan">Md Khan</name><affiliation><mods:affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: md.khan@scm.uws.edu.au</mods:affiliation></affiliation></author><author><name sortKey="Perrussel, Laurent" sort="Perrussel, Laurent" uniqKey="Perrussel L" first="Laurent" last="Perrussel">Laurent Perrussel</name><affiliation><mods:affiliation>IRIT, University of Toulouse, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: laurent.perrussel@univ-tlse1.fr</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Atching</term><term>Auction</term><term>Bidding prices</term><term>Compatibility</term><term>Double auction</term><term>Double auction design</term><term>Double auction market</term><term>Double auction mechanism</term><term>Double auction mechanism design</term><term>Experimental results</term><term>Extra matchable</term><term>Extran umberof</term><term>High liquidity</term><term>Incentive compatibility</term><term>Individual rationality</term><term>Last matchable</term><term>Liquidity</term><term>Liquidity maximization</term><term>Long term</term><term>Market liquidity</term><term>Market model</term><term>Market share</term><term>Matchable</term><term>Maximal</term><term>Mechanism design</term><term>Multiple buyers</term><term>Order output</term><term>Recursively check</term><term>Same number</term><term>Sellers</term><term>Social welfare</term><term>Sort order</term><term>Theoretical results</term><term>Total amount</term><term>Tournament platform</term><term>Trader distribution</term><term>Trading agent competition market design</term><term>Transaction volume</term><term>Uniform price</term><term>Worst case</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Algorithm</term><term>Atching</term><term>Auction</term><term>Bidding prices</term><term>Compatibility</term><term>Double auction</term><term>Double auction design</term><term>Double auction market</term><term>Double auction mechanism</term><term>Double auction mechanism design</term><term>Experimental results</term><term>Extra matchable</term><term>Extran umberof</term><term>High liquidity</term><term>Incentive compatibility</term><term>Individual rationality</term><term>Last matchable</term><term>Liquidity</term><term>Liquidity maximization</term><term>Long term</term><term>Market liquidity</term><term>Market model</term><term>Market share</term><term>Matchable</term><term>Maximal</term><term>Mechanism design</term><term>Multiple buyers</term><term>Order output</term><term>Recursively check</term><term>Same number</term><term>Sellers</term><term>Social welfare</term><term>Sort order</term><term>Theoretical results</term><term>Total amount</term><term>Tournament platform</term><term>Trader distribution</term><term>Trading agent competition market design</term><term>Transaction volume</term><term>Uniform price</term><term>Worst case</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading Agent Competition Market Design) platform, we show with experiments that the new matching method not only increases market liquidity but also significantly improves market share and auctioneer’s profit in the long term, compared with equilibrium matching, the most commonly used matching method.</div></front></TEI><istex><corpusName>springer</corpusName><keywords><teeft><json:string>atching</json:string><json:string>matchable</json:string><json:string>double auction</json:string><json:string>algorithm</json:string><json:string>liquidity</json:string><json:string>social welfare</json:string><json:string>compatibility</json:string><json:string>incentive compatibility</json:string><json:string>extra matchable</json:string><json:string>double auction market</json:string><json:string>market liquidity</json:string><json:string>double auction mechanism</json:string><json:string>auction</json:string><json:string>maximal</json:string><json:string>double auction mechanism design</json:string><json:string>liquidity maximization</json:string><json:string>sort order</json:string><json:string>market share</json:string><json:string>multiple buyers</json:string><json:string>trader distribution</json:string><json:string>sellers</json:string><json:string>trading agent competition market design</json:string><json:string>experimental results</json:string><json:string>theoretical results</json:string><json:string>tournament platform</json:string><json:string>total amount</json:string><json:string>individual rationality</json:string><json:string>uniform price</json:string><json:string>long term</json:string><json:string>mechanism design</json:string><json:string>last matchable</json:string><json:string>order output</json:string><json:string>high liquidity</json:string><json:string>recursively check</json:string><json:string>bidding prices</json:string><json:string>extran umberof</json:string><json:string>worst case</json:string><json:string>same number</json:string><json:string>transaction volume</json:string><json:string>double auction design</json:string><json:string>market model</json:string></teeft></keywords><author><json:item><name>Dengji Zhao</name><affiliations><json:string>Intelligent Systems Laboratory, University of Western, Sydney, Australia</json:string><json:string>IRIT, University of Toulouse, France</json:string><json:string>E-mail: dzhao@scm.uws.edu.au</json:string></affiliations></json:item><json:item><name>Dongmo Zhang</name><affiliations><json:string>Intelligent Systems Laboratory, University of Western, Sydney, Australia</json:string><json:string>E-mail: dongmo@scm.uws.edu.au</json:string></affiliations></json:item><json:item><name>Md Khan</name><affiliations><json:string>Intelligent Systems Laboratory, University of Western, Sydney, Australia</json:string><json:string>E-mail: md.khan@scm.uws.edu.au</json:string></affiliations></json:item><json:item><name>Laurent Perrussel</name><affiliations><json:string>IRIT, University of Toulouse, France</json:string><json:string>E-mail: laurent.perrussel@univ-tlse1.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/1BB-T343NWQX-9</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading Agent Competition Market Design) platform, we show with experiments that the new matching method not only increases market liquidity but also significantly improves market share and auctioneer’s profit in the long term, compared with equilibrium matching, the most commonly used matching method.</abstract><qualityIndicators><score>7.198</score><pdfWordCount>3962</pdfWordCount><pdfCharCount>20186</pdfCharCount><pdfVersion>1.6</pdfVersion><pdfPageCount>10</pdfPageCount><pdfPageSize>429.725 x 659.895 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>103</abstractWordCount><abstractCharCount>701</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Maximal Matching for Double Auction</title><chapterId><json:string>52</json:string><json:string>Chap52</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2011</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor></serie><host><title>AI 2010: Advances in Artificial Intelligence</title><language><json:string>unknown</json:string></language><copyrightDate>2011</copyrightDate><doi><json:string>10.1007/978-3-642-17432-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-642-17432-2</json:string></eisbn><bookId><json:string>978-3-642-17432-2</json:string></bookId><isbn><json:string>978-3-642-17431-5</json:string></isbn><volume>6464</volume><pages><first>516</first><last>525</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Jiuyong Li</name><affiliations><json:string>School of Computer and Information Science, University of South Australia, 5095, Mawson Lakes, SA, Australia</json:string><json:string>E-mail: jiuyong.li@unisa.edu.au</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Data Mining and Knowledge Discovery</value></json:item><json:item><value>Computation by Abstract Devices</value></json:item></subject></host><namedEntities><unitex><date><json:string>2011</json:string><json:string>2010</json:string></date><geogName></geogName><orgName><json:string>University of Toulouse, France</json:string></orgName><orgName_funder></orgName_funder><orgName_provider></orgName_provider><persName><json:string>Distribution</json:string><json:string>Please</json:string><json:string>Competition</json:string><json:string>J. Li</json:string><json:string>Auctioneer</json:string></persName><placeName></placeName><ref_url></ref_url><ref_bibl><json:string>[6]</json:string><json:string>[3,10]</json:string><json:string>[8]</json:string><json:string>[1]</json:string><json:string>[3]</json:string><json:string>[1,2,3]</json:string><json:string>D. Zhao et al.</json:string><json:string>Wurman et al.</json:string><json:string>Wurman et al. [5]</json:string><json:string>[7]</json:string><json:string>[9]</json:string><json:string>[4,5]</json:string></ref_bibl><bibl></bibl></unitex></namedEntities><ark><json:string>ark:/67375/1BB-T343NWQX-9</json:string></ark><categories><inist><json:string>1 - sciences appliquees, technologies et medecines</json:string><json:string>2 - sciences exactes et technologie</json:string><json:string>3 - sciences appliquees</json:string><json:string>4 - informatique. automatique theorique. systemes</json:string></inist></categories><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-17432-2_52</json:string></doi><id>35F48BDB366863B55A7522498C82BC13EEAE0CA2</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/document/35F48BDB366863B55A7522498C82BC13EEAE0CA2/fulltext/pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/document/35F48BDB366863B55A7522498C82BC13EEAE0CA2/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/35F48BDB366863B55A7522498C82BC13EEAE0CA2/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Maximal Matching for Double Auction</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher scheme="https://publisher-list.data.istex.fr">Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><licence><p>Springer Berlin Heidelberg, 2010</p></licence><p scheme="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</p></availability><date>2010</date></publicationStmt><notesStmt><note type="conference" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Maximal Matching for Double Auction</title><author xml:id="author-0000"><persName><forename type="first">Dengji</forename><surname>Zhao</surname></persName><email>dzhao@scm.uws.edu.au</email><affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</affiliation><affiliation>IRIT, University of Toulouse, France</affiliation></author><author xml:id="author-0001"><persName><forename type="first">Dongmo</forename><surname>Zhang</surname></persName><email>dongmo@scm.uws.edu.au</email><affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</affiliation></author><author xml:id="author-0002"><persName><forename type="first">Md</forename><surname>Khan</surname></persName><email>md.khan@scm.uws.edu.au</email><affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</affiliation></author><author xml:id="author-0003"><persName><forename type="first">Laurent</forename><surname>Perrussel</surname></persName><email>laurent.perrussel@univ-tlse1.fr</email><affiliation>IRIT, University of Toulouse, France</affiliation></author><idno type="istex">35F48BDB366863B55A7522498C82BC13EEAE0CA2</idno><idno type="ark">ark:/67375/1BB-T343NWQX-9</idno><idno type="DOI">10.1007/978-3-642-17432-2_52</idno><idno type="ChapterID">52</idno><idno type="ChapterID">Chap52</idno></analytic><monogr><title level="m">AI 2010: Advances in Artificial Intelligence</title><title level="m" type="sub">23rd Australasian Joint Conference, Adelaide, Australia, December 7-10, 2010. Proceedings</title><idno type="DOI">10.1007/978-3-642-17432-2</idno><idno type="pISBN">978-3-642-17431-5</idno><idno type="eISBN">978-3-642-17432-2</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="book-title-id">215460</idno><idno type="book-id">978-3-642-17432-2</idno><idno type="book-chapter-count">52</idno><idno type="book-volume-number">6464</idno><idno type="book-sequence-number">6464</idno><idno type="PartChapterCount">5</idno><editor xml:id="book-author-0000"><persName><forename type="first">Jiuyong</forename><surname>Li</surname></persName><email>jiuyong.li@unisa.edu.au</email><affiliation>School of Computer and Information Science, University of South Australia, 5095, Mawson Lakes, SA, Australia</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6464</biblScope><biblScope unit="page" from="516">516</biblScope><biblScope unit="page" to="525">525</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor xml:id="serie-author-0000"><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor xml:id="serie-author-0002"><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor xml:id="serie-author-0003"><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor xml:id="serie-author-0004"><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor xml:id="serie-author-0005"><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor xml:id="serie-author-0006"><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor xml:id="serie-author-0007"><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor xml:id="serie-author-0008"><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor xml:id="serie-author-0009"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor xml:id="serie-author-0010"><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor xml:id="serie-author-0011"><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor xml:id="serie-author-0012"><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor xml:id="serie-author-0013"><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor xml:id="serie-author-0014"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2011</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-id">558</idno></series><series><title level="s">Lecture Notes in Artificial Intelligence</title><editor xml:id="serie-author-0000"><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor xml:id="serie-author-0001"><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor xml:id="serie-author-0002"><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor xml:id="serie-author-0003"><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor xml:id="serie-author-0004"><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor xml:id="serie-author-0005"><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor xml:id="serie-author-0006"><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor xml:id="serie-author-0007"><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor xml:id="serie-author-0008"><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor xml:id="serie-author-0009"><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor xml:id="serie-author-0010"><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor xml:id="serie-author-0011"><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor xml:id="serie-author-0012"><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor xml:id="serie-author-0013"><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor xml:id="serie-author-0014"><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><editor xml:id="serie-author-0015"><persName><forename type="first">Randy</forename><surname>Goebel</surname></persName><affiliation>University of Alberta, Edmonton, Canada</affiliation></editor><editor xml:id="serie-author-0016"><persName><forename type="first">Jörg</forename><surname>Siekmann</surname></persName><affiliation>University of Saarland, Saarbrücken, Germany</affiliation></editor><editor xml:id="serie-author-0017"><persName><forename type="first">Wolfgang</forename><surname>Wahlster</surname></persName><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation></editor><editor xml:id="serie-author-0018"><persName><forename type="first">Jiuyong</forename><surname>Li</surname></persName><email>jiuyong.li@unisa.edu.au</email><affiliation>School of Computer and Information Science, University of South Australia, 5095, Mawson Lakes, SA, Australia</affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><biblScope unit="seriesId">1244</biblScope></series></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading Agent Competition Market Design) platform, we show with experiments that the new matching method not only increases market liquidity but also significantly improves market share and auctioneer’s profit in the long term, compared with equilibrium matching, the most commonly used matching method.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I21017</label><label>I18040</label><label>I18032</label><label>I18024</label><label>I18030</label><label>I16013</label><item><term>Computer Science</term></item><item><term>Artificial Intelligence (incl. Robotics)</term></item><item><term>Information Systems Applications (incl.Internet)</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Database Management</term></item><item><term>Data Mining and Knowledge Discovery</term></item><item><term>Computation by Abstract Devices</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2017-10-4">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/document/35F48BDB366863B55A7522498C82BC13EEAE0CA2/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Randy</GivenName><FamilyName>Goebel</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Wolfgang</GivenName><FamilyName>Wahlster</FamilyName></EditorName></Editor><Affiliation ID="Aff16"><OrgName>University of Alberta</OrgName><OrgAddress><City>Edmonton</City><Country>Canada</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>DFKI and University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-642-17432-2</BookID><BookTitle>AI 2010: Advances in Artificial Intelligence</BookTitle><BookSubTitle>23rd Australasian Joint Conference, Adelaide, Australia, December 7-10, 2010. Proceedings</BookSubTitle><BookVolumeNumber>6464</BookVolumeNumber><BookSequenceNumber>6464</BookSequenceNumber><BookDOI>10.1007/978-3-642-17432-2</BookDOI><BookTitleID>215460</BookTitleID><BookPrintISBN>978-3-642-17431-5</BookPrintISBN><BookElectronicISBN>978-3-642-17432-2</BookElectronicISBN><BookChapterCount>52</BookChapterCount><BookCopyright><CopyrightHolderName>Springer Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2011</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I18040" Priority="2" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18032" Priority="3" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18024" Priority="4" Type="Secondary">Database Management</BookSubject><BookSubject Code="I18030" Priority="5" Type="Secondary">Data Mining and Knowledge Discovery</BookSubject><BookSubject Code="I16013" Priority="6" Type="Secondary">Computation by Abstract Devices</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID><SubSeriesID>1244</SubSeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Jiuyong</GivenName><FamilyName>Li</FamilyName></EditorName><Contact><Email>jiuyong.li@unisa.edu.au</Email></Contact></Editor><Affiliation ID="Aff19"><OrgDivision>School of Computer and Information Science</OrgDivision><OrgName>University of South Australia</OrgName><OrgAddress><Postcode>5095</Postcode><City>Mawson Lakes</City><State>SA</State><Country>Australia</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part10"><PartInfo TocLevels="0"><PartID>10</PartID><PartSequenceNumber>10</PartSequenceNumber><PartTitle>AI Applications</PartTitle><PartChapterCount>5</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>AI 2010: Advances in Artificial Intelligence</BookTitle></PartContext></PartInfo><Chapter ID="Chap52" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>52</ChapterID><ChapterDOI>10.1007/978-3-642-17432-2_52</ChapterDOI><ChapterSequenceNumber>52</ChapterSequenceNumber><ChapterTitle Language="En">Maximal Matching for Double Auction</ChapterTitle><ChapterFirstPage>516</ChapterFirstPage><ChapterLastPage>525</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>10</PartID><BookID>978-3-642-17432-2</BookID><BookTitle>AI 2010: Advances in Artificial Intelligence</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff20 Aff21"><AuthorName DisplayOrder="Western"><GivenName>Dengji</GivenName><FamilyName>Zhao</FamilyName></AuthorName><Contact><Email>dzhao@scm.uws.edu.au</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Dongmo</GivenName><FamilyName>Zhang</FamilyName></AuthorName><Contact><Email>dongmo@scm.uws.edu.au</Email></Contact></Author><Author AffiliationIDS="Aff20"><AuthorName DisplayOrder="Western"><GivenName>Md</GivenName><FamilyName>Khan</FamilyName></AuthorName><Contact><Email>md.khan@scm.uws.edu.au</Email></Contact></Author><Author AffiliationIDS="Aff21"><AuthorName DisplayOrder="Western"><GivenName>Laurent</GivenName><FamilyName>Perrussel</FamilyName></AuthorName><Contact><Email>laurent.perrussel@univ-tlse1.fr</Email></Contact></Author><Affiliation ID="Aff20"><OrgDivision>Intelligent Systems Laboratory</OrgDivision><OrgName>University of Western</OrgName><OrgAddress><City>Sydney</City><Country>Australia</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgDivision>IRIT</OrgDivision><OrgName>University of Toulouse</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading Agent Competition Market Design) platform, we show with experiments that the new matching method not only increases market liquidity but also significantly improves market share and auctioneer’s profit in the long term, compared with equilibrium matching, the most commonly used matching method.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This research was supported by the Australian Research Council through Discovery Project DP0988750.</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Maximal Matching for Double Auction</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Maximal Matching for Double Auction</title></titleInfo><name type="personal"><namePart type="given">Dengji</namePart><namePart type="family">Zhao</namePart><affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</affiliation><affiliation>IRIT, University of Toulouse, France</affiliation><affiliation>E-mail: dzhao@scm.uws.edu.au</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Dongmo</namePart><namePart type="family">Zhang</namePart><affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</affiliation><affiliation>E-mail: dongmo@scm.uws.edu.au</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Md</namePart><namePart type="family">Khan</namePart><affiliation>Intelligent Systems Laboratory, University of Western, Sydney, Australia</affiliation><affiliation>E-mail: md.khan@scm.uws.edu.au</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Laurent</namePart><namePart type="family">Perrussel</namePart><affiliation>IRIT, University of Toulouse, France</affiliation><affiliation>E-mail: laurent.perrussel@univ-tlse1.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2010</dateIssued><dateIssued encoding="w3cdtf">2011</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract: We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading Agent Competition Market Design) platform, we show with experiments that the new matching method not only increases market liquidity but also significantly improves market share and auctioneer’s profit in the long term, compared with equilibrium matching, the most commonly used matching method.</abstract><relatedItem type="host"><titleInfo><title>AI 2010: Advances in Artificial Intelligence</title><subTitle>23rd Australasian Joint Conference, Adelaide, Australia, December 7-10, 2010. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Jiuyong</namePart><namePart type="family">Li</namePart><affiliation>School of Computer and Information Science, University of South Australia, 5095, Mawson Lakes, SA, Australia</affiliation><affiliation>E-mail: jiuyong.li@unisa.edu.au</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I18030">Data Mining and Knowledge Discovery</topic><topic authority="SpringerSubjectCodes" authorityURI="I16013">Computation by Abstract Devices</topic></subject><identifier type="DOI">10.1007/978-3-642-17432-2</identifier><identifier type="ISBN">978-3-642-17431-5</identifier><identifier type="eISBN">978-3-642-17432-2</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">215460</identifier><identifier type="BookID">978-3-642-17432-2</identifier><identifier type="BookChapterCount">52</identifier><identifier type="BookVolumeNumber">6464</identifier><identifier type="BookSequenceNumber">6464</identifier><identifier type="PartChapterCount">5</identifier><part><date>2011</date><detail type="part"><title>AI Applications</title></detail><detail type="volume"><number>6464</number><caption>vol.</caption></detail><extent unit="pages"><start>516</start><end>525</end></extent></part><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2011</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Randy</namePart><namePart type="family">Goebel</namePart><affiliation>University of Alberta, Edmonton, Canada</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Wolfgang</namePart><namePart type="family">Wahlster</namePart><affiliation>DFKI and University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jiuyong</namePart><namePart type="family">Li</namePart><affiliation>School of Computer and Information Science, University of South Australia, 5095, Mawson Lakes, SA, Australia</affiliation><affiliation>E-mail: jiuyong.li@unisa.edu.au</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer Berlin Heidelberg, 2011</recordOrigin></recordInfo></relatedItem><identifier type="istex">35F48BDB366863B55A7522498C82BC13EEAE0CA2</identifier><identifier type="ark">ark:/67375/1BB-T343NWQX-9</identifier><identifier type="DOI">10.1007/978-3-642-17432-2_52</identifier><identifier type="ChapterID">52</identifier><identifier type="ChapterID">Chap52</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer Berlin Heidelberg, 2010</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-3XSW68JL-F">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/document/35F48BDB366863B55A7522498C82BC13EEAE0CA2/metadata/json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000999 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000999 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:35F48BDB366863B55A7522498C82BC13EEAE0CA2
|texte= Maximal Matching for Double Auction
}}
| This area was generated with Dilib version V0.6.33. |  |