skip to main content
10.1145/1367497.1367719acmconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
poster

Offline matching approximation algorithms in exchange markets

Published:21 April 2008Publication History

ABSTRACT

Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets. We consider two main models of one-shot markets and exchange markets over time. For one-shot markets, we study three main variants of the problem: one-to-one exchange market problem, exchange market problem with short cycles, and probabilistic exchange market problem. We show that all the above problems are NP-hard, and propose heuristics and approximation algorithms for these problems. Experiments show that the number of items exchanged will increase when exchanges through cycles are allowed. Exploring algorithms for markets over time is an interesting direction for future work.

References

  1. D. J. Abraham, A. Blum, and T. Sandholm. Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges. In ACM Conference on Electronic Commerce, pages 295--304, June 13--16 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. E. M. Arkin and R. Hassin. On local search for weighted k-set packing. In ESA 1997, pages 13--22, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. Chandra and M. Halldorsson. Greedy local improvement and weighted set packing approximation. In SODA 1999, pages 169--176, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. I. Holyer. The np-completeness of some edge-partition problems. SIAM Journal of Computing,, 10(4):713--717, November 1981.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Offline matching approximation algorithms in exchange markets

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        WWW '08: Proceedings of the 17th international conference on World Wide Web
        April 2008
        1326 pages
        ISBN:9781605580852
        DOI:10.1145/1367497

        Copyright © 2008 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 21 April 2008

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • poster

        Acceptance Rates

        Overall Acceptance Rate1,899of8,196submissions,23%

        Upcoming Conference

        WWW '24
        The ACM Web Conference 2024
        May 13 - 17, 2024
        Singapore , Singapore

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader