SCOPUS 정보 검색 플랫폼

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 502-511

Limitations of randomized mechanisms for combinatorial auctions

(2) Dughmi, Shaddin a Vondrák, Jan b

a STANFORD UNIVERSITY (United States)

b IBM ALMADEN RESEARCH CENTER (United States)

Author keywords

combinatorial auctions; mechanism design; submodular functions

Indexed keywords

ALGORITHMIC MECHANISM DESIGN; APPROXIMATION RATIOS; COMBINATORIAL AUCTION; COMPUTATIONALLY EFFICIENT; INCENTIVE COMPATIBILITY; INCENTIVE COMPATIBLE MECHANISMS; MECHANISM DESIGN; MODULAR FUNCTIONS; ORACLE MODEL; POLYNOMIAL TIME APPROXIMATION; POLYNOMIAL-TIME; PUBLIC PROJECT; RANDOMIZED MECHANISM; RESOURCE ALLOCATION PROBLEM; SOCIAL WELFARE; STRATEGIC CONSIDERATIONS; SUBMODULAR FUNCTIONS; THEORY AND PRACTICE; TRUTHFUL MECHANISMS;

COMMERCE; COMPUTER SCIENCE; MACHINE DESIGN; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84863311520 PISSN: 02725428 EISSN: None Source Type: Conference Proceeding
DOI: 10.1109/FOCS.2011.64 Document Type: Conference Paper

Times cited : (40)

References (26)

1
- 0003430191
- 2nd edition. Wiley Interscience
- N. Alon and J.H. Spencer. The probabilistic method (2nd edition). Wiley Interscience, 2000.
- (2000) The Probabilistic Method
- Alon, N.¹ Spencer, J.H.²

2
- 77951673980
- Inapproximability for VCG-based combinatorial auctions
- th ACM-SIAM SODA, 518-536, 2010.
- (2010) th ACM-SIAM SODA , pp. 518-536
- Buchfuhrer, D.¹ Dughmi, S.² Fu, H.³ Kleinberg, R.⁴ Mossel, E.⁵ Papadimitriou, C.⁶ Schapira, M.⁷ Singer, Y.⁸ Umans, C.⁹

3
- 77954719030
- Computation and incentives in combinatorial public projects
- thACM EC, 33-42, 2010.
- (2010) thACM EC , pp. 33-42
- Buchfuhrer, D.¹ Schapira, M.² Singer, Y.³

4
- 38049090315
- Maximizing a submodular set function subject to a matroid constraint
- th IPCO, 182-196, 2007.
- (2007) th IPCO , pp. 182-196
- Calinescu, G.¹ Chekuri, C.² Pál, M.³ Vondrák, J.⁴

5
- 38049012993
- Two randomized mechanisms for combinatorial auctions
- S. Dobzinski. Two randomized mechanisms for combinatorial auctions. Proc. of APPROX 2007, 89-103.
- Proc. of APPROX 2007 , pp. 89-103
- Dobzinski, S.¹

6
- 77952327039
- On the power of randomization in algorithmic mechanism design
- th IEEE FOCS, 505-514, 2009.
- (2009) th IEEE FOCS , pp. 505-514
- Dobzinski, S.¹ Dughmi, S.²

7
- 35448999665
- Limitations of VCG-based mechanisms
- th ACM STOC, 338-344, 2007.
- (2007) th ACM STOC , pp. 338-344
- Dobzinski, S.¹ Nisan, N.²

8
- 33244457832
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- th SODA, 1064-1073, 2006.
- (2006) th SODA , pp. 1064-1073
- Dobzinski, S.¹ Schapira, M.²

9
- 79959747287
- An impossibility result for truthful combinatorial auctions with submodular valuations
- rdACM STOC, 139-148, 2011.
- (2011) rdACM STOC , pp. 139-148
- Dobzinski, S.¹

10
- 78751564971
- Black box randomized reductions in algorithmic mechanism design
- stIEEE FOCS, 775-784, 2010.
- (2010) stIEEE FOCS , pp. 775-784
- Dughmi, S.¹ Roughgarden, T.²

11
- 79959753563
- From convex optimization to randomized mechanisms: Toward optimal combinatorial auctions
- rd ACM STOC, 149-158, 2011.
- (2011) rd ACM STOC , pp. 149-158
- Dughmi, S.¹ Roughgarden, T.² Yan, Q.³

12
- 84863327474
- Manuscript
- S. Dughmi, T. Roughgarden, J. Vondrák and Q. Yan. An approximately truthful-in-expectation mechanism for combinatorial auctions using value queries. Manuscript, 2011.
- (2011) An Approximately Truthful-in-expectation Mechanism for Combinatorial Auctions Using Value Queries
- Dughmi, S.¹ Roughgarden, T.² Vondrák, J.³ Yan, Q.⁴

13
- 79959592600
- A truthful randomized mechanism for combinatorial public projects via convex optimization
- thACM EC, 263-272, 2011.
- (2011) thACM EC , pp. 263-272
- Dughmi, S.¹

14
- 0032108328
- A Threshold of ln n for Approximating Set Cover
- U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998. (Pubitemid 128488790)
- (1998) Journal of the ACM , vol.45 , Issue.4 , pp. 634-652
- Feige, U.¹

15
- 46749125782
- Maximizing a nonmonotone submodular function
- th IEEE FOCS, 461-471, 2007.
- (2007) th IEEE FOCS , pp. 461-471
- Feige, U.¹ Mirrokni, V.² Vondrák, J.³

16
- 49149102694
- Inapproximability results for combinatorial auctions with submodular utility functions
- S. Khot, R. Lipton, E. Markakis and A. Mehta. Inapproximability results for combinatorial auctions with submodular utility functions. Algorithmica 52:1, 3-18, 2008.
- (2008) Algorithmica , vol.52
- Khot, S.¹ Lipton, R.² Markakis, E.³ Mehta, A.⁴

17
- 70349100783
- Maximizing submodular set functions subject to multiple linear constraints
- th ACM-SIAM SODA, 545-554, 2009.
- (2009) th ACM-SIAM SODA , pp. 545-554
- Kulik, A.¹ Shachnai, H.² Tamir, T.³

18
- 0344981431
- Towards a characterization of truthful combinatorial auctions
- th IEEE FOCS, 574-583, 2003.
- (2003) th IEEE FOCS , pp. 574-583
- Lavi, R.¹ Mu'Alem, A.² Nisan, N.³

19
- 33748120378
- Truthful and near-optimal mechanism design via linear programming
- th IEEE FOCS, 595-604, 2005.
- (2005) th IEEE FOCS , pp. 595-604
- Lavi, R.¹ Swamy, C.²

20
- 70350654681
- Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
- th ACM EC, 70-77, 2008.
- (2008) th ACM EC , pp. 70-77
- Mirrokni, V.¹ Schapira, M.² Vondrák, J.³

21
- 0000095809
- An analysis of approximations for maximizing submodular set functions - I
- G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions - I. Math. Prog., 14:265-294, 1978.
- (1978) Math. Prog. , vol.14 , pp. 265-294
- Nemhauser, G.L.¹ Wolsey, L.A.² Fisher, M.L.³

22
- 84926076710
- Introduction to mechanism design (for computer scientists)
- N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds., Cambridge University Press
- N. Nisan. Introduction to mechanism design (for computer scientists). Algorithmic Game Theory (N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, eds.), Cambridge University Press, 2007.
- (2007) Algorithmic Game Theory
- Nisan, N.¹

23
- 79955724706
- Submodular maximization by simulated annealing
- nd ACM-SIAM SODA, 1098-1117, 2011.
- (2011) nd ACM-SIAM SODA , pp. 1098-1117
- Oveis Gharan, S.¹ Vondrák, J.²

24
- 57949083485
- On the hardness of being truthful
- th IEEE FOCS, 250-259, 2008.
- (2008) th IEEE FOCS , pp. 250-259
- Papadimitriou, C.¹ Schapira, M.² Singer, Y.³

25
- 57049187237
- Optimal approximation for the submodular welfare problem in the value oracle model
- thACM STOC, 67-74, 2008.
- (2008) thACM STOC , pp. 67-74
- Vondrák, J.¹

26
- 77952348721
- Symmetry and approximability of submodular maximization problems
- th IEEE FOCS, 251-270, 2009.
- (2009) th IEEE FOCS , pp. 251-270
- Vondrák, J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.