Pricing and advertising for rewardbased crowdfunding products in Ecommerce Abstract   This paper studies a rewardbased crowdfunding game wherein the creator first collects money through an Ecrowdfunding platform and then, if successful, invests the raised money to fund promotional activities via online retailing. We derive the creatoru0027s equilibrium decisions and the corresponding payoff and show that they are significantly influenced by the potential demand and the gap between different types of buyer valuations. In particular, with the change in potential market size from low to high, the creator will choose investing none, part or all of the crowdfunded money to improve the advertising level. Meanwhile, when the market size is small, the creator tends to set a high price; when it becomes larger, the creator prefers menu prices or a low price to guarantee the success of the crowdfunding campaign. Comparing two scenarios, one with and one without considering advertising investment, creators may never choose the low price if they cannot raise enough money for advertising; however, that situation can never arise without considering the option of advertising investment. These results provide implications for launching a successful crowdfunding campaign and product promotionadvertising in this Ecommerce era.

Revenue maximization in a Bayesian double auction market Abstract   We study double auction market design where the market maker wants to maximize its total revenue by buying low from the sellers and selling high to the buyers. We consider a Bayesian setting where buyers and sellers have independent probability distributions on the values of products on the market.  For the simplest setting, each seller has one kind of indivisible good with a bounded (integer) amount that can be sold to a buyer, who may demand a bounded number of copies. We develop a maximum mechanism for the market maker to maximize its own revenue.  For the more general case where each selleru0027s product may be different, we consider a number of variants in terms of constraints on supplies and demands. For each of them, we develop a polynomial time computable truthful mechanism for the market maker to achieve a revenue at least a constant  xcexb1  times the revenue of any other truthful mechanism.