{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:43:54Z","timestamp":1649115834276},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T00:00:00Z","timestamp":1377648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11227-013-1002-z","type":"journal-article","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T07:11:25Z","timestamp":1377587485000},"page":"1166-1182","source":"Crossref","is-referenced-by-count":2,"title":["Correcting vindictive bidding behaviors in sponsored search auctions"],"prefix":"10.1007","volume":"69","author":[{"given":"Chen-Kun","family":"Tsung","sequence":"first","affiliation":[]},{"given":"Hann-Jang","family":"Ho","sequence":"additional","affiliation":[]},{"given":"Sing-Ling","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,28]]},"reference":[{"issue":"1","key":"1002_CR1","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1257\/aer.97.1.242","volume":"97","author":"B Edelman","year":"2007","unstructured":"Edelman B, Ostrovsky M, Schwarz M (2007) Internet advertising and the generalized second price auction: selling billions of dollars worth of keywords. Am Econ Rev 97(1):242\u2013259","journal-title":"Am Econ Rev"},{"key":"1002_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/1282100.1282130","volume-title":"ICEC","author":"Y Zhou","year":"2007","unstructured":"Zhou Y, Lukose R (2007) Vindictive bidding in keyword auctions. In: ICEC, pp\u00a0141\u2013146"},{"issue":"6","key":"1002_CR3","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1016\/j.ijindorg.2006.10.002","volume":"25","author":"HR Varian","year":"2007","unstructured":"Varian HR (2007) Position auction. Int J Ind Organ 25(6):1163\u20131178","journal-title":"Int J Ind Organ"},{"key":"1002_CR4","first-page":"1","volume-title":"Proc ACM EC","author":"G Aggarwal","year":"2006","unstructured":"Aggarwal G, Goel A, Motwani R (2006) Truthful auctions for pricing search keywords. In: Proc ACM EC, pp\u00a01\u20137"},{"issue":"1","key":"1002_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1287\/ijoc.1050.0135","volume":"19","author":"J Feng","year":"2007","unstructured":"Feng J, Bhargava HK, Pennock DM (2007) Implementing sponsored search in web search engines: computational evaluation of alternative mechanisms. INFORMS J Comput 19(1):137\u2013148","journal-title":"INFORMS J Comput"},{"issue":"2","key":"1002_CR6","first-page":"37","volume":"3","author":"NY Yen","year":"2012","unstructured":"Yen NY, Kuo SYF (2012) An integrated approach for Internet resources mining and searching. J\u00a0Converg 3(2):37\u201344","journal-title":"J\u00a0Converg"},{"issue":"2","key":"1002_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3745\/JIPS.2012.8.2.191","volume":"8","author":"BJ Oommen","year":"2012","unstructured":"Oommen BJ, Yazidi A, Granmo O (2012) An adaptive approach to learning the preferences of users in a social network using weak estimators. Int J Inf Process Syst 8(2):191\u2013212","journal-title":"Int J Inf Process Syst"},{"issue":"4","key":"1002_CR8","first-page":"49","volume":"3","author":"D Gallego","year":"2012","unstructured":"Gallego D, Huecas G (2012) An empirical case of a context-aware mobile recommender system in a banking environment. J Converg 3(4):49\u201356","journal-title":"J Converg"},{"key":"1002_CR9","first-page":"262","volume-title":"ACM EC","author":"M Cary","year":"2007","unstructured":"Cary M, Das A, Edelman B, Giotis I, Heimerl K, Karlin AR, Mathieu C, Schwarz M (2007) Greedy bidding strategies for keyword auctions. In: ACM EC, pp\u00a0262\u2013271"},{"issue":"1","key":"1002_CR10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11227-012-0845-z","volume":"64","author":"M Abdeyazdan","year":"2013","unstructured":"Abdeyazdan M, Parsa S, Rahmani AM (2013) Task graph pre-scheduling, using Nash equilibrium in game theory. J Supercomput 64(1):177\u2013203","journal-title":"J Supercomput"},{"key":"1002_CR11","first-page":"167","volume-title":"Proc WINE","author":"L Liang","year":"2007","unstructured":"Liang L, Qi Q (2007) Cooperative or vindictive: bidding strategies in sponsored search auction. In: Proc WINE, pp\u00a0167\u2013178"},{"issue":"3","key":"1002_CR12","first-page":"23","volume":"3","author":"C Tsai","year":"2012","unstructured":"Tsai C, Chen C, Zhuang D (2012) Trusted m-banking verification scheme based on a combination of OTP and biometrics. J Converg 3(3):23\u201330","journal-title":"J Converg"},{"key":"1002_CR13","first-page":"207","volume-title":"8th annual conference on CNSR","author":"A Grillo","year":"2010","unstructured":"Grillo A, Lentini A, Naldi M, Italiano GF (2010) Penalized second price: a new pricing algorithm for advertising in search engines. In: 8th annual conference on CNSR, pp\u00a0207\u2013214"},{"issue":"2","key":"1002_CR14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/opre.1070.0384","volume":"55","author":"MH Rothkopf","year":"2007","unstructured":"Rothkopf MH (2007) Thirteen reasons why the Vickrey\u2013Clarke\u2013Groves process is not practical. Oper Res 55(2):191\u2013197","journal-title":"Oper Res"},{"key":"1002_CR15","volume-title":"Proc fourth workshop on ADKDD","author":"A Zainal-Abidin","year":"2010","unstructured":"Zainal-Abidin A, Wang J (2010) Maximizing clicks of sponsored search by integer programming. In: Proc fourth workshop on ADKDD"},{"key":"1002_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, Cambridge"},{"key":"1002_CR17","volume-title":"Auction theory","author":"V Krishna","year":"2002","unstructured":"Krishna V (2002) Auction theory. Academic Press, San Diego"},{"key":"1002_CR18","volume-title":"Sixth ad auctions workshop","author":"M Babaioff","year":"2010","unstructured":"Babaioff M, Roughgarden T (2010) Equilibrium efficiency and price complexity in sponsored search auctions. In: Sixth ad auctions workshop"},{"key":"1002_CR19","first-page":"312","volume-title":"Proc WINE","author":"E Even-Dar","year":"2007","unstructured":"Even-Dar E, Kearns M, Wortman J (2007) Sponsored search with contexts. In: Proc WINE, pp\u00a0312\u2013317"},{"issue":"4","key":"1002_CR20","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1007\/s00453-009-9280-9","volume":"58","author":"T Bu","year":"2010","unstructured":"Bu T, Liang L, Qi Q (2010) On robustness of forward-looking in sponsored search auction. Algorithmica 58(4):970\u2013989","journal-title":"Algorithmica"},{"key":"1002_CR21","first-page":"440","volume-title":"Proc UKSim","author":"M Naldi","year":"2011","unstructured":"Naldi M, Pavignani A, Grillo A, Lentini A, Italiano GF (2011) A\u00a0model for the dynamics of bidders in the simulation of keyword auctions. In: Proc UKSim, pp\u00a0440\u2013445"},{"key":"1002_CR22","first-page":"43","volume-title":"Proc UAI","author":"JS Breese","year":"1998","unstructured":"Breese JS, Heckerman D, Kadie C (1998) Empirical analysis of predictive algorithms for collaborative filtering. In: Proc UAI, pp\u00a043\u201352"},{"key":"1002_CR23","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1186\/PREACCEPT-1253053215890607","volume":"2","author":"J Bringer","year":"2012","unstructured":"Bringer J, Chabanne H (2012) Embedding edit distance to enable private keyword search. Hum-Cent Comput Inf Sci 2:2","journal-title":"Hum-Cent Comput Inf Sci"},{"key":"1002_CR24","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/2192-1962-2-4","volume":"2","author":"CR Valencio","year":"2012","unstructured":"Valencio CR, Oyama FT, Neto PS, Colombini AC, Cansian AM, Souza RCGD, Corra PLP (2012) MR-Radix: a multi-relational data mining algorithm. Hum-Cent Comput Inf Sci 2:4","journal-title":"Hum-Cent Comput Inf Sci"},{"key":"1002_CR25","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/2192-1962-2-12","volume":"2","author":"AP James","year":"2012","unstructured":"James AP, Dimitrijev S (2012) Ranked selection of nearest discriminating features. Hum-Cent Comput Inf Sci 2:12","journal-title":"Hum-Cent Comput Inf Sci"},{"issue":"4","key":"1002_CR26","doi-asserted-by":"crossref","first-page":"621","DOI":"10.3745\/JIPS.2012.8.4.621","volume":"8","author":"G Nagpal","year":"2012","unstructured":"Nagpal G, Uddin M, Kaur A (2012) A\u00a0comparative study of estimation by analogy using data mining techniques. Int J Inf Process Syst 8(4):621\u2013652","journal-title":"Int J Inf Process Syst"},{"issue":"4","key":"1002_CR27","doi-asserted-by":"crossref","first-page":"693","DOI":"10.3745\/JIPS.2012.8.4.693","volume":"8","author":"K Sarkar","year":"2012","unstructured":"Sarkar K, Nasipuri M, Ghose S (2012) Machine learning based keyphrase extraction: comparing decision trees, Naive Bayes, and artificial neural networks. Int J Inf Process Syst 8(4):693\u2013712","journal-title":"Int J Inf Process Syst"},{"issue":"2","key":"1002_CR28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/asi.20962","volume":"60","author":"MS Pera","year":"2009","unstructured":"Pera MS, Ng Y (2009) SpamED: a spam e-mail detection approach based on phrase similarity. J\u00a0Am Soc Inf Sci Technol 60(2):393\u2013409","journal-title":"J\u00a0Am Soc Inf Sci Technol"},{"issue":"5","key":"1002_CR29","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TKDE.2010.147","volume":"23","author":"C Tseng","year":"2010","unstructured":"Tseng C, Sung P, Chen M (2010) Cosdes: a collaborative spam detection system with a novel e-mail abstraction scheme. IEEE Trans Knowl Data Eng 23(5):669\u2013682","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1002-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-013-1002-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-013-1002-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:11Z","timestamp":1559384651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-013-1002-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,28]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["1002"],"URL":"http:\/\/dx.doi.org\/10.1007\/s11227-013-1002-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,28]]}}}
