Pervasive computing, which requires applications composed of independent and distributed components, is an important domain for dynamic ubiquitous heterogeneous environment. However, one of the critical challenges it ...Pervasive computing, which requires applications composed of independent and distributed components, is an important domain for dynamic ubiquitous heterogeneous environment. However, one of the critical challenges it faces is resource allocation. To overcome the difficulty, enhanced universal service terminal （UST＋） is designed as a reflective middleware combined distributed components with particular features to achieve user goals. Moreover, a novel algorithm based on microeconomics is presented to resolve conflicting resource allocation and is implemented on top of the UST＋. Besides, an example outlines how this algorithm is used in pervasive computing, and the simulation results illustrate that the proposed mechanism can achieve high performance at low cost.展开更多
Sponsored search advertising is a significant revenue source for search engines. To ameliorate revenues, search engines often set fixed or variable reserve price to in influence advertisers＇ bidding. This paper studi...Sponsored search advertising is a significant revenue source for search engines. To ameliorate revenues, search engines often set fixed or variable reserve price to in influence advertisers＇ bidding. This paper studies the optimal reserve price for a generalized second-price auction （GSP） under both static and dynamic settings. We show that if advertisers＇ per-click value has an increasing generalized failure rate, the search engine＇s revenue rate is quasi-concave and hence there exists an optimal reserve price under both settings. Different from a static GSP auction where the optimal reserve price is proved to be constant, in a dynamic setting the optimal reserve price is dependent on not only advertisers＇ per-click values, but also the number of ad links sold. A search engine should gradually raise reserve price as more qualified advertisers arrive, and maintain the same threshold after all first-page positions are occupied.展开更多
In this paper we reanalyze Said’s(2011) work by retaining all his assumptions except that we use the first-price auction to sell differentiated goods to buyers in dynamic markets instead of the second-price auction. ...In this paper we reanalyze Said’s(2011) work by retaining all his assumptions except that we use the first-price auction to sell differentiated goods to buyers in dynamic markets instead of the second-price auction. We conclude that except for the expression of the equilibrium bidding strategy, all the results for the first-price auction are exactly the same as the corresponding ones for the second-price auction established by Said(2011). This implies that the well-known "revenue equivalence theorem"holds true for Said’s(2011) dynamic model setting.展开更多
基金supported by the Hi-Tech Research and Development Program of China (2009AA01Z262,2006DFA11050)the Beijing Munical Education Commission (KM200910016003)
文摘Pervasive computing, which requires applications composed of independent and distributed components, is an important domain for dynamic ubiquitous heterogeneous environment. However, one of the critical challenges it faces is resource allocation. To overcome the difficulty, enhanced universal service terminal （UST＋） is designed as a reflective middleware combined distributed components with particular features to achieve user goals. Moreover, a novel algorithm based on microeconomics is presented to resolve conflicting resource allocation and is implemented on top of the UST＋. Besides, an example outlines how this algorithm is used in pervasive computing, and the simulation results illustrate that the proposed mechanism can achieve high performance at low cost.
文摘Sponsored search advertising is a significant revenue source for search engines. To ameliorate revenues, search engines often set fixed or variable reserve price to in influence advertisers＇ bidding. This paper studies the optimal reserve price for a generalized second-price auction （GSP） under both static and dynamic settings. We show that if advertisers＇ per-click value has an increasing generalized failure rate, the search engine＇s revenue rate is quasi-concave and hence there exists an optimal reserve price under both settings. Different from a static GSP auction where the optimal reserve price is proved to be constant, in a dynamic setting the optimal reserve price is dependent on not only advertisers＇ per-click values, but also the number of ad links sold. A search engine should gradually raise reserve price as more qualified advertisers arrive, and maintain the same threshold after all first-page positions are occupied.
基金Supported by the National Natural Science Foundation of China(71171052)
文摘In this paper we reanalyze Said’s(2011) work by retaining all his assumptions except that we use the first-price auction to sell differentiated goods to buyers in dynamic markets instead of the second-price auction. We conclude that except for the expression of the equilibrium bidding strategy, all the results for the first-price auction are exactly the same as the corresponding ones for the second-price auction established by Said(2011). This implies that the well-known "revenue equivalence theorem"holds true for Said’s(2011) dynamic model setting.
