Advertisement

Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets

  • Evangelos Markakis
  • Orestis Telelis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9928)

Abstract

We study the computation of revenue-maximizing envy-free outcomes in a monopoly market with budgeted buyers. Departing from previous works, we focus on buyers with asymmetric combinatorial valuation functions over subsets of items. We first establish a hardness result showing that, even with two identical additive buyers, the problem is inapproximable. In an attempt to identify tractable families of the problem’s instances, we introduce the notion of budget compatible buyers, placing a restriction on the budget of each buyer in terms of his valuation function. Under this assumption, we establish approximation upper bounds for buyers with submodular valuations over preference subsets as well as for buyers with identical subadditive valuation functions. Finally, we also analyze an algorithm for arbitrary additive valuation functions, which yields a constant factor approximation for a constant number of buyers. We conclude with several intriguing open questions regarding budgeted buyers with asymmetric valuation functions.

Keywords

Valuation Function Combinatorial Auction Constant Approximation Walrasian Equilibrium Revenue Maximization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Balcan, M.F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. Theory Comput. 3(1), 179–195 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Briest, P.: Uniform budgets and the envy-free pricing problem. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 808–819. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1093–1102 (2006)Google Scholar
  4. 4.
    Chen, N., Deng, X.: Envy-free pricing in multi-item markets. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 418–429. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Cheung, M., Swamy, C.: Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 35–44 (2008)Google Scholar
  6. 6.
    Colini-Baldeschi, R., Leonardi, S., Sankowski, P., Zhang, Q.: Revenue maximizing envy-free fixed-price auctions with budgets. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 233–246. Springer, Heidelberg (2014)Google Scholar
  7. 7.
    Dobzinski, S., Lavi, R., Nisan, N.: Multi-unit auctions with budget limits. Games econ. behav. 74(2), 486–503 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. Math. Oper. Res. 35(1), 1–13 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Feldman, M., Fiat, A., Leonardi, S., Sankowski, P.: Revenue maximizing envy-free multi-unit auctions with budgets. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC), pp. 532–549 (2012)Google Scholar
  10. 10.
    Fiat, A., Leonardi, S., Saia, J., Sankowski, P.: Single valued combinatorial auctions with budgets. In: Proceedings of the 12th ACM Conference on Electronic Commerce (EC), pp. 223–232 (2011)Google Scholar
  11. 11.
    Fiat, A., Wingarten, A.: Envy, multi envy, and revenue maximization. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 498–504. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  12. 12.
    Foley, D.: Resource allocation and the public sector. Yale Econ. Essays 7, 45–98 (1967)Google Scholar
  13. 13.
    Goel, G., Mirrokni, V.S., Paes Leme, R.: Polyhedral clinching auctions and the adwords polytope. J. ACM 62(3), 18 (2015)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Gul, F., Stacchetti, E.: Walrasian equilibrium with gross substitutes. J. Econ. Theory 87(1), 95–124 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1164–1173 (2005)Google Scholar
  16. 16.
    Hartline, J., Yan, Q.: Envy, truth, and profit. In: Proceedings of the 12th ACM Conference on Electronic Commerce (EC), pp. 243–252 (2011)Google Scholar
  17. 17.
    Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270–296 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Lehmann, D.J., O’Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. J. ACM 49(5), 577–602 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  19. 19.
    Monaco, G., Sankowski, P., Zhang, Q.: Revenue maximization envy-free pricing for homogeneous resources. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 90–96 (2015)Google Scholar
  20. 20.
    Varian, H.: Equity, envy and efficiency. J. Econ. Theory 9, 63–91 (1974)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Woeginger, G.H., Yu, Z.: On the equal-subset-sum problem. Inf. Process. Lett. 42(6), 299–302 (1992)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Department of InformaticsAthens University of Economics and BusinessAthensGreece
  2. 2.Department of Digital SystemsUniversity of PiraeusPiraeusGreece

Personalised recommendations