307 research outputs found

    Dominant bidding strategy in Mobile App advertising auction

    Get PDF
    The widespread use of intelligent mobile phone has promoted prosperity of mobile App advertising in recent years. Based on existing bidding status, this paper presents the dominant bidding strategy for mobile advertising auction. Firstly, our study characterizes multiple Nash Equilibria resulting from different bidding strategies in wGSP (weighted Generalized Second-Price) auction. Further more, we prove that advertiser’s rank and utility will not decrease by using the dominant bidding strategy. We also consider the situation where the reserve price is set by the mobile advertising platform. It turns out that that advertiser’s payment will be no less than reserve price. Finally, a practical implementation for a virtual market simulates the dynamic bidding process in real world environments.published_or_final_versio

    A Free Exchange e-Marketplace for Digital Services

    Get PDF
    The digital era is witnessing a remarkable evolution of digital services. While the prospects are countless, the e-marketplaces of digital services are encountering inherent game-theoretic and computational challenges that restrict the rational choices of bidders. Our work examines the limited bidding scope and the inefficiencies of present exchange e-marketplaces. To meet challenges, a free exchange e-marketplace is proposed that follows the free market economy. The free exchange model includes a new bidding language and a double auction mechanism. The rule-based bidding language enables the flexible expression of preferences and strategic conduct. The bidding message holds the attribute-valuations and bidding rules of the selected services. The free exchange deliberates on attributes and logical bidding rules for automatic deduction and formation of elicited services and bids that result in a more rapid self-managed multiple exchange trades. The double auction uses forward and reverse generalized second price auctions for the symmetric matching of multiple digital services of identical attributes and different quality levels. The proposed double auction uses tractable heuristics that secure exchange profitability, improve truthful bidding and deliver stable social efficiency. While the strongest properties of symmetric exchanges are unfeasible game-theoretically, the free exchange converges rapidly to the social efficiency, Nash truthful stability, and weak budget balance by multiple quality-levels cross-matching, constant learning and informs at repetitive thick trades. The empirical findings validate the soundness and viability of the free exchange

    Is Google the next Microsoft? Competition, Welfare and Regulation in Internet Search

    Get PDF
    Internet search (or perhaps more accurately `web-search') has grown exponentially over the last decade at an even more rapid rate than the Internet itself. Starting from nothing in the 1990s, today search is a multi-billion dollar business. Search engine providers such as Google and Yahoo! have become household names, and the use of a search engine, like use of the Web, is now a part of everyday life. The rapid growth of online search and its growing centrality to the ecology of the Internet raise a variety of questions for economists to answer. Why is the search engine market so concentrated and will it evolve towards monopoly? What are the implications of this concentration for different `participants' (consumers, search engines, advertisers)? Does the fact that search engines act as `information gatekeepers', determining, in effect, what can be found on the web, mean that search deserves particularly close attention from policy-makers? This paper supplies empirical and theoretical material with which to examine many of these questions. In particular, we (a) show that the already large levels of concentration are likely to continue (b) identify the consequences, negative and positive, of this outcome (c) discuss the possible regulatory interventions that policy-makers could utilize to address these

    A Theoretical Examination of Practical Game Playing: Lookahead Search

    Full text link
    Abstract. Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide variety of applications. To determine a strategy play using lookahead search, each agent predicts multiple levels of possible re-actions to her move (via the use of a search tree), and then chooses the play that optimizes her future payoff accounting for these re-actions. There are several choices of optimization function the agents can choose, where the most appropriate choice of function will depend on the specifics of the actual game- we illustrate this in our examples. Furthermore, the type of search tree chosen by computationally-constrained agent can vary. We focus on the case where agents can evaluate only a bounded number, k, of moves into the future. That is, we use depth k search trees and call this approach k-lookahead search. We apply our method in five well-known settings: industrial organization (Cournot’s model); AdWord auctions; congestion games; valid-utility games and basic-utility games; cost-sharing network design games. We consider two questions. First, what i

    Measuring the Efficiency of an FCC Spectrum Auction

    Get PDF
    FCC spectrum auctions sell licenses to provide mobile phone service in designated geographic territories. We propose a method to structurally estimate the deterministic component of bidder valuations and apply it to the 1995–1996 C-block auction. We base our estimation of bidder values on a pairwise stability condition, which implies that two bidders cannot exchange licenses in a way that increases total surplus. Pairwise stability holds in many theoretical models of simultaneous ascending auctions, including some models of intimidatory collusion and demand reduction. Pairwise stability is also approximately satisfied in data that we examine from economic experiments. The lack of post-auction resale also suggests pairwise stability. Using our estimates of deterministic valuations, we measure the allocative efficiency of the C-block outcome.

    Foundations of mechanism design: a tutorial Part 1- Key concepts and classical results

    Get PDF
    Mechanism design, an important tool in microeconomics, has found widespread applications in modelling and solving decentralized design problems in many branches of engineering, notably computer science, electronic commerce, and network economics. Mechanism design is concerned with settings where a social planner faces the problem of aggregating the announced preferences of multiple agents into a collective decision when the agents exhibit strategic behaviour. The objective of this paper is to provide a tutorial introduction to the foundations and key results in mechanism design theory. The paper is in two parts. Part 1 focuses on basic concepts and classical results which form the foundation of mechanism design theory. Part 2 presents key advanced concepts and deeper results in mechanism design

    Stochastic Budget Optimization in Internet Advertising

    Full text link
    Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the advertisements, and each "target" has a collection of games with a potentially different set of players involved. In this paper, we study the problem of how advertisers allocate their budget across these "targets". In particular, we focus on formulating their best response strategy as an optimization problem. Advertisers have a set of keywords ("targets") and some stochastic information about the future, namely a probability distribution over scenarios of cost vs click combinations. This summarizes the potential states of the world assuming that the strategies of other players are fixed. Then, the best response can be abstracted as stochastic budget optimization problems to figure out how to spread a given budget across these keywords to maximize the expected number of clicks. We present the first known non-trivial poly-logarithmic approximation for these problems as well as the first known hardness results of getting better than logarithmic approximation ratios in the various parameters involved. We also identify several special cases of these problems of practical interest, such as with fixed number of scenarios or with polynomial-sized parameters related to cost, which are solvable either in polynomial time or with improved approximation ratios. Stochastic budget optimization with scenarios has sophisticated technical structure. Our approximation and hardness results come from relating these problems to a special type of (0/1, bipartite) quadratic programs inherent in them. Our research answers some open problems raised by the authors in (Stochastic Models for Budget Optimization in Search-Based Advertising, Algorithmica, 58 (4), 1022-1044, 2010).Comment: FINAL versio
    corecore