On efficient recommendations for online exchange markets

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 712-723

  Abbassi, Zeinab ^a   Lakshmanan, Laks V S ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; APPROXIMATION QUALITY; CYCLE LENGTH; DETERMINISTIC MODELS; EFFICIENT APPROXIMATION ALGORITHMS; LOCAL SEARCH; NETWORK SIZE; NP COMPLETE; ONLINE EXCHANGE; ONLINE MARKETS; OTHER ALGORITHMS; PROBABILISTIC MODELS; SOCIAL NETWORK;

COMMERCE;

APPROXIMATION ALGORITHMS;

EID: 67649651672     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.105     Document Type: Conference Paper

References (33)

1. "http://blog.compete.com/2007/01/25/top-20-websites-ranked-by- timespent/."
2. "http://www.peerflix.com."
3. "http://www.readitswapit.co.uk."
4. "http://www.oddshoe.org."
5. N. Immorlica, V. S. Mirrokni, and M. Mahdian, "Cycle cover with short cycles," STACS 2005.
6. M. Guan, "Graphic programming using odd and even points," Chinese Mathematics, vol. 1, pp. 273-277, 1962.
7. J. Edmonds and E. Johnson, "Matching euler tours and the chinese postman problem." Mathematical programming, vol. 5, pp. 88-124, 1973.
8. C. H. Papadimitriou, "On the complexity of edge traversing." Journal of the ACM, vol. 23, no. 3, pp. 544-554, 1976.
9. B. Rachavachari and J. Veerasamy, "A 3/2-approximation algorithm for the mixed postman problem," SIAM journal of Discrete Math., vol. 12, pp. 425-433, 1999.
10. C. Thomassen, "On the complexity of finding a minimum cycle cover of a graph," SIAM J. Comput., vol. 26, no. 3, pp. 675-677, 1997.
11. D. Hochbaum and E. Olinick, "The bounded cycle-cover problem," INFORMS Journal on Computing, vol. 13, no. 2, pp. 104-109, 2001.
12. E. Rich, "User modeling via stereotypes." Cognitive Science, vol. 3, no. 4, pp. 329-354, 1979.
13. M. Powell, Approximation Theory and Methods. Cambridge University Press, 1981.
14. G. Salton, Automatic Text Processing.Addison-Wesley, 1989.
15. B. Murthi and S. Sarkar, "The role of the management sciences in research on personalization," Management Science, vol. 49, no. 10, pp. 1344-1362, 2003.
16. P. Resnick et al. "Grouplens: An open architecture for collaborative filtering of netnews," in Computer Supported Cooperative Work Conference, 1994.
17. -,"Grouplens: An open architecture for collaborative filtering of netnews," in Computer Supported Cooperative Work Conference, 1994.
18. G. Shani, R. Brafman, and D. Heckerman, "An mdp-based recommender system," UAI 2002.
19. G. Adomavicius and A. Tuzhilin, "Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions." IEEE TKDE, vol. 17, no. 6, pp. 734-749, 2005.
20. W. Cohen, R. Schapire, and Y. Singer, "Learning to order things," Journal of Artificial Intelligence Research, vol. 10, pp. 243-270, 1999.
21. Y. Freund et al. "An efficient boosting algorithm for combining preferences," ICML 1998.
22. R. Jin, L. Si, and C. Zhai, "Preference-based graphic models for collaborative filtering," in UAI 2003.
23. R. Jin et al. "Collaborative filtering with decoupled models for preferences and ratings," CIKM 2003.
24. D. J. Abraham, A. Blum, and T. Sandholm, "Clearing algorithms for barter exchange markets: Enabling nationwide kidney exchanges," in ACM Conference on Electronic Commerce, June 13-16 2007, pp. 295-304.
25. K. G. Anagnostakis and M. B. Greenwald, "Exchange-based incentive mechanisms for peer-to-peer file sharing," in 24th International Conference on Distributed Computing Systems, 2004, pp. 524-533.
26. N. Andrade et al. "Influences on cooperation in bittorrent communities," in SIGCOMM Workshops, 2005.
27. F. Wu and L. Zhang, "Proportional response dynamics leads to market equilibrium." in STOC, 2007, pp. 354 - 363.
28. D. J. Abraham et al. "Assignment problems in rental markets," in WINE 2006, 2006, pp. 198-213.
29. I. Holyer, "The NP-completeness of some edge-partition problems."SIAM Journal of Computing,, vol. 10, no. 4, pp. 713-717, November 1981.
30. M. R. Garey and D. S. Johnson, Computers and Intractability. New York: Freeman, 1979.
31. B. Chandra and M. Halldorsson, "Greedy local improvement and weighted set packing approximation," in SODA 1999, 1999, pp. 169-176.
32. E. M. Arkin and R. Hassin, "On local search for weighted k-set packing." in ESA 1997, 1997, pp. 13-22.
33. M. E. J. Newman, "The structure and function of complex networks." SIAM Reviews, vol. 45(2), pp. 167-256, 2003.