Sketching valuation functions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1025-1035

  Badanidiyuru, Ashwinkumar ^a   Dobzinski, Shahar ^a   Fu, Hu ^a   Kleinberg, Robert ^a   Nisan, Noam ^b   Roughgarden, Tim ^c  

^a Department of Obstetrics Gynecology   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

COMBINATORIAL AUCTION; COMPUTATIONALLY EFFICIENT; DETERMINISTIC ALGORITHMS; FUNCTION MAPPING; POLYNOMIAL NUMBER; SUBADDITIVE FUNCTION; SUBMODULAR FUNCTIONS; VALUATION FUNCTION;

LEARNING ALGORITHMS;

EID: 84860161802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.81     Document Type: Conference Paper

References (21)

1. Ashwinkumar Badanidiyuru, Shahar Dobzinski, and Sigal Oren. Optimization with demand oracles. CoRR, abs/1107.2869, 2011.
2. Maria Fiorina Balcan, Florin Constantin, Satoru Iwata, and Lei Wang. Learning valuation functions. CoRR, abs/1108.5669, 2011.
3. Maria-Fiorina Balcan and Nicholas J. A. Harvey. Learning submodular functions. In Lance Fortnow and Salil P. Vadhan, editors, STOC, pages 793-802. ACM, 2011.
4. Alejandro Bertelsen. Substitutes valuations and m-concavity". M.Sc. Thesis, The Hebrew University of Jerusalem, 2005.
5. Kshipra Bhawalkar and Tim Roughgarden. Welfare guarantees for combinatorial auctions with item bidding. In Dana Randall, editor, SODA, pages 700-709. SIAM, 2011.
6. Liad Blumrosen. Information and communication in mechanism design. PhD Thesis, The Hebrew University of Jerusalem, 2006.
7. Liad Blumrosen and Noam Nisan. Combinatorial auctions. In Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, 2007.
8. Liad Blumrosen and Noam Nisan. On the computational power of demand queries. SIAM J. Comput., 39(4):1372-1391, 2009.
9. S. Dobzinski, N. Nisan, and M. Schapira. Approximation algorithms for combinatorial auctions with complement-free bidders. Mathematics of Operations Research, 35:1-13, 2010.
10. Shahar Dobzinski. Two randomized mechanisms for combinatorial auctions. In APPROX, 2007.
11. Shahar Dobzinski, Noam Nisan, and Michael Schapira. Approximation algorithms for combinatorial auctions with complement-free bidders. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005.
12. Uriel Feige. On maximizing welfare when utility functions are subadditive. Siam Journal on Computing, 39:41-50, 2006.
13. Michel X. Goemans, Nicholas J. A. Harvey, Satoru Iwata, and Vahab S. Mirrokni. Approximating submodular functions everywhere. In Claire Mathieu, editor, SODA, pages 535-544. SIAM, 2009.
14. A. Krause and C. Guestrin. Beyond convexity: Submodularity in machine learning, 2008. http://submodularity.org.
15. A. Krause and C. Guestrin. Intelligent information gathering and submodular function optimization, 2009. http://submodularity.org/ijcai09/index. html.
16. Benny Lehmann, Daniel Lehmann, and Noam Nisan. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55(2):270-296, 2006.
17. L. Lovász. Submodular functions and convexity. In Mathemtical Programming: The State of The Art, pages 235-257. Bonn, 1982.
18. Elchanan Mossel and Sébastien Roch. Submodularity of influence in social networks: From local to global. SIAM J. Comput., 39(6):2176-2188, 2010.
19. Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. Cambridge University Press, Cambridge, 1995.
20. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions i. Mathematical Programming, 14, 1978.
21. D.M. Topkis. Supermodularity and Complementarity. Princeton University Press, 1998.