Bidding Strategies for Proportional Representation in Advertisement Campaigns

Inbal Livni Navon, Charlotte Peale, Omer Reingold, Judy Hanwen Shen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Many companies rely on advertising platforms such as Google, Facebook, or Instagram to recruit a large and diverse applicant pool for job openings. Prior works have shown that equitable bidding may not result in equitable outcomes due to heterogeneous levels of competition for different types of individuals. Suggestions have been made to address this problem via revisions to the advertising platform. However, it may be challenging to convince platforms to undergo a costly re-vamp of their system, and in addition it might not offer the flexibility necessary to capture the many types of fairness notions and other constraints that advertisers would like to ensure. Instead, we consider alterations that make no change to the platform mechanism and instead change the bidding strategies used by advertisers. We compare two natural fairness objectives: one in which the advertisers must treat groups equally when bidding in order to achieve a yield with group-parity guarantees, and another in which the bids are not constrained and only the yield must satisfy parity constraints. We show that requiring parity with respect to both bids and yield can result in an arbitrarily large decrease in efficiency compared to requiring equal yield proportions alone. We find that autobidding is a natural way to realize this latter objective and show how existing work in this area can be extended to provide efficient bidding strategies that provide high utility while satisfying group parity constraints as well as deterministic and randomized rounding techniques to uphold these guarantees. Finally, we demonstrate the effectiveness of our proposed solutions on data adapted from a real-world employment dataset.

Original languageEnglish
Title of host publication4th Symposium on Foundations of Responsible Computing, FORC 2023
EditorsKunal Talwar
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959772723
DOIs
StatePublished - 1 Jun 2023
Externally publishedYes
Event4th Symposium on Foundations of Responsible Computing, FORC 2023 - Stanford, United States
Duration: 7 Jun 20239 Jun 2023

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume256
ISSN (Print)1868-8969

Conference

Conference4th Symposium on Foundations of Responsible Computing, FORC 2023
Country/TerritoryUnited States
CityStanford
Period7/06/239/06/23

Keywords

  • Algorithmic fairness
  • advertisement auctions
  • diversity

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Bidding Strategies for Proportional Representation in Advertisement Campaigns'. Together they form a unique fingerprint.

Cite this