---
res:
  bibo_abstract:
  - "In a Stackelberg pricing game a leader aims to set prices on a subset of a given
    collection of items, such as to maximize her revenue from a follower purchasing
    a feasible subset of the items. We focus on the case of computationally bounded
    followers who cannot optimize exactly over the range of all feasible subsets,
    but apply some publicly known algorithm to determine the set of items to purchase.
    This corresponds to general multi-dimensional pricing assuming that consumers
    cannot optimize over the full domain of their valuation functions but still aim
    to act rationally to the best of their ability.\r\n\r\nWe consider two versions
    of this novel type of Stackelberg pricing games. Assuming that items are weighted
    objects and the follower seeks to purchase a min-cost selection of objects of
    some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate
    algorithm, we show how an extension of the known single-price algorithm can be
    used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s
    revenue maximization problem based on so-called near-uniform price assignments.
    We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case
    that items are subsets of some ground set which the follower seeks to cover (the
    Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform
    price assignments fail to yield a good approximation guarantee. However, in the
    special case of elements with frequency 2 (the Vertex-Cover problem) it turns
    out that exact revenue maximization can be done in polynomial-time. This stands
    in sharp contrast to the fact that revenue maximization becomes APX-hard already
    for elements with frequency 3.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Patrick
      foaf_name: Briest, Patrick
      foaf_surname: Briest
  - foaf_Person:
      foaf_givenName: Martin
      foaf_name: Hoefer, Martin
      foaf_surname: Hoefer
  - foaf_Person:
      foaf_givenName: Luciano
      foaf_name: Gualà, Luciano
      foaf_surname: Gualà
  - foaf_Person:
      foaf_givenName: Carmine
      foaf_name: Ventre, Carmine
      foaf_surname: Ventre
  bibo_doi: 10.1007/978-3-642-10841-9_6
  dct_date: 2009^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/0302-9743
  - http://id.crossref.org/issn/1611-3349
  dct_language: eng
  dct_title: On Stackelberg Pricing with Computationally Bounded Consumers@
...