Skip to main content

2018 | OriginalPaper | Buchkapitel

Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations

verfasst von : Moran Feldman, Gonen Frim, Rica Gonen

Erschienen in: Decision and Game Theory for Security

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Online advertising has motivated companies to collect vast amounts of information about users, which increasingly creates privacy concerns. One way to answer these concerns is by enabling end users to choose which aspects of their private information can be collected. Based on principles suggested by Feldman and Gonen (2018), we introduce a new online advertising market model which uses information brokers to give users such control. Unlike Feldman and Gonen (2018), our model is dynamic and involves multi-sided markets where all participating sides are strategic. We describe a mechanism for this model which is theoretically guaranteed to (approximately) maximize the gain from trade, avoid a budget deficit and incentivize truthfulness and voluntary participation. As far as we know, this is the first known dynamic mechanism for a multi-sided market having these properties.
We experimentally examine and compare our theoretical results using real world advertising bid data. The experiments suggest that our mechanism performs well in practice even in regimes for which our theoretical guarantee is weak or irrelevant.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
The use of mediators is necessary because it should not be possible to link an information portfolio offered for sell on the market to any particular user, which prevents users from interacting directly with the market.
 
2
Blum et al. [4] has multiple different objectives (maximizing profit, liquidity and welfare). We refer to the objective which is most relevant to our work.
 
3
Informally, an agent is truthful if he/she reports the information as it is known to him/her. A formal definition of what it means for a user, mediator or advertiser to be truthful is given in Sect. 2.
 
4
Here and throughout the paper, a reference to domination of strategies should always be understood as a reference to weak domination.
 
5
A mechanism is budget balanced if the amount it charges (from the advertisers) is at least as large as the amount it pays.
 
6
The mediators’ utility functions are independent of the amount of money transferred from the mediators to the users. This choice was made with the aim of balancing two of the mediators’ conflicting objectives: on the one hand, mediators want to make as much money as possible, and on the other hand, they want to acquire users and have them use their services rather than switch to another mediator who is known for paying more money to his users.
 
7
In some cases the assumption that the mechanism has a prior knowledge about the number of entities might be considered unnatural. The mechanism we present can be modified using standard techniques to work with an alternative assumption stating that each entity arrives at a uniformly random time from some range (for example, [0, 1]). See [11] for more details.
 
8
Our experiments are based on only a fraction of the entire data set, which significantly increased the market strength of the entities in the input. To compensate for this increase, and keep the market strength of each advertiser in the simulation similar to the market strength of the corresponding real world advertiser, we introduced a division by 100 into the capacity formula.
 
9
Note that the experiments did not simulate the information trading part of the model since they were intended to study the mechanism’s competitive ratio. However, information exchange can occur in our model in practice. Intuitively, one can think of the users in a single execution of the mechanism as the users who agreed to sell information that, if revealed, implies that they have one particular type t. Then, if an advertiser’s ad is shown to a user, the advertiser may learn that the user is of type t and the user is monetarily compensated for that.
 
Literatur
1.
Zurück zum Zitat Ashlagi, I., Monderer, D., Tennenholtz, M.: Mediators in position auctions. Games Econ. Behav. 67, 2–21 (2009)MathSciNetCrossRef Ashlagi, I., Monderer, D., Tennenholtz, M.: Mediators in position auctions. Games Econ. Behav. 67, 2–21 (2009)MathSciNetCrossRef
2.
Zurück zum Zitat Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA, pp. 1245–1254 (2009)CrossRef Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: SODA, pp. 1245–1254 (2009)CrossRef
3.
Zurück zum Zitat Babaioff, M., Feldman, M., Tennenholtz, M.: Mechanism design with strategic mediators. ACM Trans. Econ. Comput. 4, 7:1–7:48 (2016)MathSciNetCrossRef Babaioff, M., Feldman, M., Tennenholtz, M.: Mechanism design with strategic mediators. ACM Trans. Econ. Comput. 4, 7:1–7:48 (2016)MathSciNetCrossRef
4.
Zurück zum Zitat Blum, A., Sandholm, T., Zinkevich, M.: Online algorithms for market clearing. In: SODA, pp. 971–980 (2002) Blum, A., Sandholm, T., Zinkevich, M.: Online algorithms for market clearing. In: SODA, pp. 971–980 (2002)
5.
Zurück zum Zitat Bredin, J., Parkes, D., Duong, Q.: Chain: a dynamic double auction framework for matching patient agents. J. Artif. Intell. Res. 30, 133–179 (2007)MathSciNetCrossRef Bredin, J., Parkes, D., Duong, Q.: Chain: a dynamic double auction framework for matching patient agents. J. Artif. Intell. Res. 30, 133–179 (2007)MathSciNetCrossRef
7.
Zurück zum Zitat Conitzer, V., Taylor, C.R., Wagman, L.: Hide and seek: costly consumer privacy in a market with repeat purchases. Mark. Sci. 31(2), 277–292 (2012)CrossRef Conitzer, V., Taylor, C.R., Wagman, L.: Hide and seek: costly consumer privacy in a market with repeat purchases. Mark. Sci. 31(2), 277–292 (2012)CrossRef
12.
Zurück zum Zitat Feldman, M., Svensson, O., Zenklusen, R.: A simple \(O\)(log log (rank))-competitive algorithm for the matroid secretary problem. Math. Oper. Res. 43(2), 638–650 (2018)MathSciNetCrossRef Feldman, M., Svensson, O., Zenklusen, R.: A simple \(O\)(log log (rank))-competitive algorithm for the matroid secretary problem. Math. Oper. Res. 43(2), 638–650 (2018)MathSciNetCrossRef
13.
Zurück zum Zitat Gonen, M., Gonen, R., Pavlov, E.: Generalized trade reduction mechanisms. In: EC, pp. 20–29. ACM, New York (2007) Gonen, M., Gonen, R., Pavlov, E.: Generalized trade reduction mechanisms. In: EC, pp. 20–29. ACM, New York (2007)
14.
Zurück zum Zitat Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352–358 (1990) Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352–358 (1990)
16.
Zurück zum Zitat Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29, 265–281 (1983)MathSciNetCrossRef Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. J. Econ. Theory 29, 265–281 (1983)MathSciNetCrossRef
17.
Zurück zum Zitat Segal-Halevi, E., Hassidim, A., Aumann, Y.: MUDA: a truthful multi-unit double-auction mechanism. In: Proceeding of AAAI (2018) Segal-Halevi, E., Hassidim, A., Aumann, Y.: MUDA: a truthful multi-unit double-auction mechanism. In: Proceeding of AAAI (2018)
18.
Zurück zum Zitat Stavrogiannis, L.C., Gerding, E.H., Polukarov, M.: Auction mechanisms for demand-side intermediaries in online advertising exchanges. In: AAMAS, pp. 5–9. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2014) Stavrogiannis, L.C., Gerding, E.H., Polukarov, M.: Auction mechanisms for demand-side intermediaries in online advertising exchanges. In: AAMAS, pp. 5–9. International Foundation for Autonomous Agents and Multiagent Systems, Richland (2014)
19.
Zurück zum Zitat Vaze, R., Coupechoux, M.: Online budgeted truthful matching. SIGMETRICS Perform. Eval. Rev. 44(3), 3–6 (2016)CrossRef Vaze, R., Coupechoux, M.: Online budgeted truthful matching. SIGMETRICS Perform. Eval. Rev. 44(3), 3–6 (2016)CrossRef
20.
Zurück zum Zitat Wurman, P., Walsh, W., Wellman, M.: Flexible double auctions for electronic commerce: theory and implementation. Decis. Support Syst. 24, 17–27 (1998)CrossRef Wurman, P., Walsh, W., Wellman, M.: Flexible double auctions for electronic commerce: theory and implementation. Decis. Support Syst. 24, 17–27 (1998)CrossRef
Metadaten
Titel
Multi-sided Advertising Markets: Dynamic Mechanisms and Incremental User Compensations
verfasst von
Moran Feldman
Gonen Frim
Rica Gonen
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-030-01554-1_13

Premium Partner