Maximizing Gain over Flexible Attributes in Peer to Peer Marketplaces
Peer to peer marketplaces enable transactional exchange of services directly between people. In such platforms, those providing a service are faced with various choices. For example in travel peer to peer marketplaces, although some amenities (attributes) in a property are fixed, others are relatively flexible and can be provided without significant effort. Providing an attribute is usually associated with a cost. Naturally, different sets of attributes may have a different “gains” for a service provider. Consequently, given a limited budget, deciding which attributes to offer is challenging.
In this paper, we formally introduce and define the problem of Gain Maximization over Flexible Attributes (GMFA) and study its complexity. We provide a practically efficient exact algorithm to the GMFA problem that can handle any monotonic gain function. Since the users of the peer to peer marketplaces may not have access to any extra information other than existing tuples in the database, as the next part of our contribution, we introduce the notion of frequent-item based count (FBC), which utilizes nothing but the database itself. We conduct a comprehensive experimental evaluation on real data from AirBnB and a case study that confirm the efficiency and practicality of our proposal.
- 1.Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: VLDB (1994)Google Scholar
- 3.Asudeh, A., Zhang, N., Das, G.: Query reranking as a service. PVLDB 9(11), 888–899 (2016)Google Scholar
- 4.Bertsekas, D.P., Özveren, C., Stamoulis, G.D., Tseng, P., Tsitsiklis, J.N.: Optimal communication algorithms for hypercubes. JPDC 11(4), 263–275 (1991)Google Scholar
- 5.Das, M., Das, G., Hristidis, V.: Leveraging collaborative tagging for web item design. In: SIGKDD (2011)Google Scholar
- 6.Ertz, M., Durif, F.: Collaborative consumption or the rise of the two-sided consumer. J. Bus. Manage. 4, 195–209 (2016)Google Scholar
- 7.Feldman, M., Izsak, R.: Constrained monotone function maximization and the supermodular degree. arXiv preprint arXiv:1407.6328 (2014)
- 8.Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)Google Scholar
- 11.Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD. ACM (2000)Google Scholar
- 12.Lhote, L., Rioult, F., Soulet, A.: Average number of frequent (closed) patterns in Bernoulli and Markovian databases. In: ICDM. IEEE (2005)Google Scholar
- 13.Miah, M., Das, G., Hristidis, V., Mannila, H.: Determining attributes to maximize visibility of objects. TKDE 21, 959–973 (2009)Google Scholar
- 15.Asudeh, A., Nazi, A., Koudas, N., Das, G.: Assisting service providers in peer-to-peer marketplaces: maximizing gain over flexible attributes. CoRR, abs/1705.03028 (2017)Google Scholar
- 16.Rymon, R.: Search through systematic set enumeration (1992)Google Scholar
- 19.Witzgall, C.: Mathematical methods of site selection for electronic message systems (EMS). NASA STI/Recon Tech, Report (1975)Google Scholar