1 |
U. Feige, V. S. Mirrokni, and J. Vondrak, "Maximizing non-monotone submodular functions," SIAM J. Comput., 40(4), pp. 1133-1153, 2011.
DOI
|
2 |
E. De Poorter, P. Becue, and M. Rovcanin, "A negotiation-based networking methodology to enable cooperation across heterogeneous co-located networks," Ad Hoc Netw., 10, pp. 901-917, 2012.
DOI
|
3 |
S. Zhong, L. Li, Y. G. Liu, and Y. Yang, "On designing incentivecompatible routing and forwarding protocols in wireless ad-hoc networks: An integrated approach using game theoretical and cryptographic techniques," in Proc. ACM MOBICOM, 2005, pp. 117-131.
|
4 |
S. Brahma and M. Chatterjee, "A bayesian based incentive-compatible routing mechanism for dynamic spectrum access networks," in Proc. IEEE INFOCOM, 2012, pp. 2781-2785.
|
5 |
Y. Wang and M. Singhai, "On improving the efficiency of truthful routing in MANETs with selfish nodes," Elsevier Pervasive and Mobile Comput., vol. 3, no. 5, pp. 537-559, Oct. 2007.
DOI
|
6 |
P. Maille and B. Tuffin, "Why VCG auctions can hardly be applied to the pricing of inter-domain and ad-hoc networks," in Proc. 3rd EURO-NGI, May 2007, pp. 36-39.
|
7 |
H. B. Leonard, "Elicitation of honest preferences for the assignment of individuals to positions," J. Political Economy, vol. 91, no. 3, pp. 461- 479, June 1983.
DOI
|
8 |
V. Krishna, Auction Theory, Academic Press, 2009.
|
9 |
G. Calinescu, C. Chekuri, M. Pal, and J. Vondrak, "Maximizing a submodular set function subject to a matroid constraint," SIAM J. Comput., 40(6), pp. 1740-1766, 2011.
DOI
|
10 |
R. B. Myerson, "Optimal auction design," Mathematics of Operations Research, 6(1), pp. 58-73, Feb. 1981.
DOI
|
11 |
Y. Singer, "Budget feasible mechanisms," in Proc. IEEE FOCS, 2010, pp. 765-774.
|
12 |
NS-2, http://nsnam.isi.edu/nsnam/index.php/Main_Page, 2012.
|