Modelling Externalities in Keyword Auctions PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Modelling Externalities in Keyword Auctions PDF full book. Access full book title Modelling Externalities in Keyword Auctions by Ioannis Giotis. Download full books in PDF and EPUB format.
Author: Ioannis Giotis
Publisher: LAP Lambert Academic Publishing
ISBN: 9783838375847
Category :
Languages : en
Pages : 96
Get Book Here
Book Description
Sponsored search has grown to be an important share of the advertisement market and a major income source for large Internet companies. Its success relies not only on the explosive Internet use but also on successful implementation that made it a highly efficient and profitable concept for advertisers and search engines, in particular, through the use of keyword auctions. Up until now, most of the research relies on the simplest game-theoretic models to extract useful results. We extend the most common models to encapsulate an aspect of the system that only recently has begun to draw attention; the effect of competing advertisements on the user's actions and subsequently on the advertisers' campaign efficiency. We present models that take these effects into account while remaining simple enough for us to answer the most basic game-theoretic questions about them such as the presence of equilibria and their efficiency. We also compare our models to the most common model and show their significant advantages. Finally, we discuss a proposed new mechanism that incorporates externalities and evaluate its performance.
Author: Ioannis Giotis
Publisher: LAP Lambert Academic Publishing
ISBN: 9783838375847
Category :
Languages : en
Pages : 96
Get Book Here
Book Description
Sponsored search has grown to be an important share of the advertisement market and a major income source for large Internet companies. Its success relies not only on the explosive Internet use but also on successful implementation that made it a highly efficient and profitable concept for advertisers and search engines, in particular, through the use of keyword auctions. Up until now, most of the research relies on the simplest game-theoretic models to extract useful results. We extend the most common models to encapsulate an aspect of the system that only recently has begun to draw attention; the effect of competing advertisements on the user's actions and subsequently on the advertisers' campaign efficiency. We present models that take these effects into account while remaining simple enough for us to answer the most basic game-theoretic questions about them such as the presence of equilibria and their efficiency. We also compare our models to the most common model and show their significant advantages. Finally, we discuss a proposed new mechanism that incorporates externalities and evaluate its performance.
Author: Giuseppe Persiano
Publisher: Springer Science & Business Media
ISBN: 3642248284
Category : Computers
Languages : en
Pages : 336
Get Book Here
Book Description
This book constitutes the refereed proceedings of the Fourth International Symposium on Algorithmic Game Theory, SAGT 2011, held in Amalfi, Italy, in October 2011. The 26 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on auctions and advertising, quality of solutions, externalities, mechanism design, complexity, network games, pricing, as well as routing games.
Author: Youxin Hu
Publisher:
ISBN:
Category : Consumer behavior
Languages : en
Pages : 104
Get Book Here
Book Description
Abstract: Standard literature on auctions considers isolated markets with bidders that are ex ante identical and independent. My dissertation research considers the behavior of bidders and sellers when they take into account other auctions and bidders' relative roles outside of a given auction. I further extend this investigation through classroom experiments. In the first chapter, I study bidders' optimal strategies under negative externalities (i.e., the auction may incur losses (instead of zero payoffs) to the losing bidders). I construct a model of auction with three bidders. One bidder is special in the sense that if he wins, both of the other bidders will incur a loss; the other two bidders are regular in the sense that as in a traditional auction, if one of them wins, the losing bidders will receive zero payoffs. Intuitively one expects regular bidders to bid more aggressively than normal to avoid the loss. However, I find that in an ascending clock auction, in equilibrium regular bidders bid less aggressively and quit before reaching their private values. This occurs because a regular bidder may have to bid above his value in order to win against the special bidder and thus risks negative profit by bidding aggressively. Since both regular bidders avoid the externality if either wins, there is a free riding incentive. Despite free riding, in most cases the clock auction is ex post efficient However, in first-price sealed bid auctions free riding and aggressive bidding incentives are simultaneous, so ex post efficiency is less frequent. I also conducted classroom experiments which suggest that bidders more often exhibit aggressive bidding rather than free riding in an ascending clock auction; furthermore, I show that in first-price sealed bid auctions, regular bidders bid more aggressively than the special bidder, indicating aggressive bidding incentives dominate free riding incentives. In the second chapter, I construct an auction model in which both number of bidders and sellers' reserve prices are endogenously determined, and estimate the value distribution among eBay bidders. I assume each bidder has a choice of auctions with different reserve prices and other auction specific factors (seller's reputation, shipping cost, auction duration, etc.). I show that in equilibrium, 1) each bidder must be indifferent to entry in any auction, and 2) each seller's reserve price must maximize expected revenue given auction structure and bidder entry behavior, which jointly determines the equilibrium number of bidders in each auction. Few theoretical works have been done to find the positive optimal reserve price when the number of bidder is endogenous. And previous empirical work usually uses observed bids to estimate bidders' value distribution and take sellers' choice (e.g., reserve prices) as exogenous. Based on the equilibrium relationship described above, my model allows estimation of bidders' value distribution not only from observed bids, but also from the number of bidders and reserve prices. To apply this structural estimation method, I use eBay digital camera auction data to estimate bidders' value distribution from bid observations and reserve prices.
Author: Anish Agarwal
Publisher:
ISBN:
Category :
Languages : en
Pages : 0
Get Book Here
Book Description
The design of data markets has gained importance as firms increasingly use machine learning models fueled by externally acquired training data. A key consideration is the externalities firms face when data, though inherently freely replicable, is allocated to competing firms. In this setting, we demonstrate that a data seller's optimal revenue increases as firms can pay to prevent allocations to others. To do so, we first reduce the combinatorial problem of allocating and pricing multiple datasets to the auction of a single digital good by modeling utility for data through the increase in prediction accuracy it provides. We then derive welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information- whether the externalities one exerts on others is known, or vice-versa- affects the resulting structures. In all cases, the optimal allocation rule is a single threshold per firm, where either all data is allocated or none is.
Author: Maryann Z. Rui
Publisher:
ISBN:
Category :
Languages : en
Pages : 86
Get Book Here
Book Description
Data is increasingly important for firms, regulators, and researchers to develop accurate models for decision-making. Since data sets often need to be externally acquired, a systematic way to value and trade data is necessary. Moreover, buyers of data often interact with each other downstream, such as firms competing in a market. In this setting, an allocation of data may not only benefit the buying firm, but also impose negative externalities on the firm’s competitors. The way data is allocated and sold should thus depend on the particulars of its downstream usage and the interaction between data buyers. We capture the problem of valuing and selling data sets to buyers who interact downstream within the general framework of auctions of digital, or freely replicable, goods. We study the resulting single-item and multi-item mechanism design problems in the presence of additively separable, negative allocative externalities among bidders. Two settings of bidders’ private types are considered, in which bidders either know the externalities that others exert on them or know the externalities that they exert on others. We obtain forms of the welfare-maximizing (efficient) and revenue-maximizing (optimal) auctions of single digital goods in both settings and highlight how the information structure affects the resulting mechanisms. We find that in all cases, the resulting allocation rules are deterministic single thresholding functions for each bidder. For auctions of multiple digital goods, we assume that bidders have independent, additive valuations over items and study the first setting of privately known incoming externalities. We show that the welfare-maximizing mechanism decomposes into multiple efficient single-item auctions using the Vickrey-Clarke-Groves mechanism. Under revenue-maximization, we show that selling items separately via optimal single-item auctions yields a guaranteed fraction of the optimal multi-item auction revenue. This allows us to construct approximately revenue-maximizing multi-item mechanisms using the aforementioned optimal single-item mechanisms.
Author: Tie-Yan Liu
Publisher: Springer
ISBN: 331913129X
Category : Computers
Languages : en
Pages : 512
Get Book Here
Book Description
This book constitutes the thoroughly refereed conference proceedings of the 10th International Conference on Web and Internet Economics, WINE 2014, held in Beijing, China, in December 2014. The 32 regular and 13 short papers were carefully reviewed and selected from 107 submissions and cover results on incentives and computation in theoretical computer science, artificial intelligence, and microeconomics.
Author: Xujin Chen
Publisher: Springer Nature
ISBN: 3030649466
Category : Computers
Languages : en
Pages : 476
Get Book Here
Book Description
This book constitutes the proceedings of the 16th International Conference on Web and Internet Economics, WINE 2020, held in Beijing, China, in December 2020. The 31 full papers presented together with 11 abstracts were carefully reviewed and selected from 136 submissions. The issues in theoretical computer science, artificial intelligence, operations research are of particular importance in the Web and the Internet that enable the interaction of large and diverse populations. The Conference on Web and Internet Economics (WINE) is an interdisciplinary forum for the exchange of ideas and results on incentives and computation arising from these various fields.
Author: Stefano Leonardi
Publisher: Springer Science & Business Media
ISBN: 3642108407
Category : Computers
Languages : en
Pages : 654
Get Book Here
Book Description
This volume contains the papers presented at WINE 2009:the 5th International Workshop on Internet and Network Economics held December 14–18, 2009, in Rome,attheDepartmentofComputerandSystemSciences,SapienzaUniversity of Rome. Over the past decade there has been growing interaction between researchers in theoretical computer science, networking and security, economics, mathem- ics, sociology, and management sciences devoted to the analysis of problems arising in the Internet and the worldwide web. The Workshop on Internet and Network Economics (WINE) is an interdisciplinary forum for the exchange of ideas and results arising in these varied ?elds. There were 142 submissions to the workshop including regular and short - pers.Allsubmissionswererigorouslypeer reviewedandevaluatedonthebasisof the quality of their contribution, originality,soundness, and signi?cance. Almost all submissions were reviewed by at least three Program Committee members. The committee decided to accept 34 regular papers and 29 short papers. The Best Student Paper award sponsored by Google Inc. was given to Saeed Alaei and AzarakhshMalekianfor the paper “An Analysisof Troubled Assets Reverse Auction.” The program also included three invited talks by S. Muthukrishnan (Google Inc.and RutgersUniversity),H. PeytonYoung (OxfordandJohns Hopkins U- versity)andEvaTardos(CornellUnversity).Threetutorialswerealsoo?eredon the days before the workshop, from Andrei Broder (Yahoo! Research) on C- putational Advertising, Nikhil Devanur and Kamal Jain (Microsoft Research) on Computational Issues in Market Equilibria, and Tim Roughgarden(Stanford University) on Bayesian and Worst-Case Revenue Maximization.
Author: Isabelle Brocas
Publisher:
ISBN:
Category :
Languages : en
Pages : 43
Get Book Here
Book Description
We analyze optimal auction design in the presence of negative externalities. We assume that externalities are a function of both the valuation of the agent who suffers it and the valuation of the agent who obtains the good. This introduces two different sources of countervailing incentives: the reservation utility of each bidder becomes type-dependent and the equilibrium utility is not necessarily increasing in the agent's valuation. We characterize the properties of the optimal mechanism when externalities are quot;strongly decreasingquot;, quot;weakly decreasingquot; and quot;increasingquot; in the agent's valuation. Last, we discuss its implementation with sealed-bid auctions. Interestingly, bidding strategies are not necessarily increasing in valuations, and the optimal mechanism can be implemented by setting a price ceiling instead of a reserve price.
Author: Philippe Jehiel
Publisher:
ISBN:
Category : Auctions
Languages : en
Pages : 26
Get Book Here
Book Description
