Statistical mechanics of budget-constrained auctions

Journal of Statistical Mechanics: Theory and Experiment

Volumn 2009, Issue 7, 2009, Pages

  Altarelli, F ^a   Braunstein, A ^b   Realpe Gomez, J ^b   Zecchina, R ^b  

^a ISI FOUNDATION   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Applications to game theory and mathematical economics; Cavity and replica method; Message passing algorithms

Indexed keywords

EID: 71049162522     PISSN: 17425468     EISSN: 17425468     Source Type: Journal    
DOI: 10.1088/1742-5468/2009/07/P07002     Document Type: Article

References (19)

1. Lehmann B, Lehmann D and Nisan N 2001 Combinatorial auctions with decreasing marginal utilities Proc. 3rd ACM Conf. on Electronic Commerce p18
2. Andelman N and Mansour Y 2004 Auctions with budget constraints 9th Scandinavian Workshop on Algorithm Theory (SWAT) (Berlin: Springer) p26
3. Azar Y, Birnbaum B, Karlin AR, Mathieu C and Nguyen C T 2008 Improved approximation algorithms for budgeted allocations Lecture Notes in Computer Science 5125 (Berlin: Springer) p186
4. Mehta A, Saberi A, Vazirani U and Vazirani V 2007 Adwords and generalized online matching J. Assoc. Comput. Mach. 54 22
5. Galla T, Leone M, Marsili M, Sellitto M, Weigt M and Zecchina R 2006 Statistical mechanics of combinatorial auctions Phys. Rev. Lett. 97 128701
6. Kschischang F R, Frey B J and Loeliger H-A 2002 Factor graphs and the sum-product algorithm IEEE Trans. Inform. Theory 47 498
7. Mézard M and Parisi G 2001 The Bethe lattice spin glass revisited Eur. Phys. J. B 20 217
8. Mézard M and Parisi G 2003 The cavity method at zero temperature J. Stat. Phys. 111 1
9. Braunstein A, Mézard M and Zecchina R 2005 Survey propagation: an algorithm for satisfiability Random Struct. Algorithm 27 201
10. Mézard M and Zecchina R 2002 The random K-satisfiability problem: from an analytic solution to an efficient algorithm Phys. Rev. E 66 056126
11. Braunstein A and Zecchina R 2006 Learning by message passing in networks of discrete synapses Phys. Rev. Lett. 96 030201
12. Montanari A, Parisi G and Ricci-Tersenghi F 2004 Instability of one-step replica-symmetry-broken phase in satisfiability problems J. Phys. A: Math. Gen. 37 2073
13. Marinari E and Semerjian G 2006 On the number of circuits in random graphs J. Stat. Mech. P06019
14. Raymond J, Sportiello A and Zdeborov L 2007 The phase diagram of 1-in-3 satisfiability problem Phys. Rev. E 76 011101
15. Kirkpatrick S, Gelatt C D Jr and Vecchi M P 1982 Optimization by simulated annealing IBM Research Report RC p 9355
16. Kirkpatrick S, Gelatt C D Jr and Vecchi M P 1983 Optimization by simulated annealing Science 220 671
17. Matouek J and Gärtner B 2007 Understanding and Using Linear Programming (Berlin: Springer)
18. Garg R, Kumar V and Pandit V 2001 Approximation algorithms for budget-constrained auctions Lecture Notes on Computer Science vol 2129 (Berlin: Springer) p102
19. Bayati M, Borgs C, Chayes J and Zecchina R 2008 On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to Linear Programs J. Stat. Mech. L06001