Advanced Search
MyIDEAS: Login

Citations for "Combinatorial agency"

by Babaioff, Moshe & Feldman, Michal & Nisan, Noam & Winter, Eyal

For a complete description of this item, click here. For a RSS feed for citations of this item, click here.
as in new window
  1. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
  2. Song, Jiongjiong & Regan, A C, 2003. "Approximation Algorithms for the Bid Construction Problem in Combinatorial Auctions for the Procurement of Freight Transportation Contracts," University of California Transportation Center, Working Papers qt3j7034z2, University of California Transportation Center.
  3. Itai Sher, 2012. "Optimal shill bidding in the VCG mechanism," Economic Theory, Springer, vol. 50(2), pages 341-387, June.
  4. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  5. Jawad Abrache & Teodor Gabriel Crainic & Michel Gendreau, 2002. "Models for Bundle Trading in Financial Markets," CIRANO Working Papers 2002s-84, CIRANO.
  6. Lawrence M. Ausubel & Peter Cramton & Paul Milgrom, 2012. "System and Method for a Hybrid Clock and Proxy Auction," Papers of Peter Cramton 10acmhc, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
  7. Lunander, Anders & Lundberg, Sofia, 2011. "Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts," UmeÃ¥ Economic Studies 825, Umeå University, Department of Economics.
  8. Lawrence M. Ausubel & Paul Milgrom, 2005. "Ascending Proxy Auctions," Levine's Bibliography 122247000000000785, UCLA Department of Economics.
  9. Rica Gonen & Anat Lerner, 2013. "The Incompatibility of Pareto Optimality and Dominant-Strategy Incentive Compatibility in Sufficiently-Anonymous Budget-Constrained Quasilinear Settings," Games, MDPI, Open Access Journal, vol. 4(4), pages 690-710, November.
  10. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer, vol. 42(1), pages 193-236, January.
  11. Blumrosen, Liad & Feldman, Michal, 2013. "Mechanism design with a restricted action space," Games and Economic Behavior, Elsevier, vol. 82(C), pages 424-443.
  12. Ariane Lambert-Mogiliansky & Konstantin Sonin, 2005. "Collusive market-sharing and corruption in procurement," PSE Working Papers halshs-00590773, HAL.
  13. Debasis Mishra & Souvik Roy, 2011. "Implementation in multidimensional dichotomous domains," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 11-15, Indian Statistical Institute, New Delhi, India.
  14. Lawrence M. Ausubel & Peter Cramton & Wynne P. Jones, 2012. "System and Method for an Auction of Multiple Types of Items," Papers of Peter Cramton 11acjam, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
  15. Ilan Nehama, 2013. "Complexity of Optimal Lobbying in Threshold Aggregation," Discussion Paper Series dp642, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  16. Dash, Rajdeep K & Giovannucci, Andrea & Jennings, Nicholas R. & Mezzetti, Claudio & Ramchurn, Sarvapali D. & Rodriguez-Aguilar, Juan A., 2008. "Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty," The Warwick Economics Research Paper Series (TWERPS) 880, University of Warwick, Department of Economics.
  17. Paul Milgrom, 2008. "Assignment Messages and Exchanges," Discussion Papers 08-014, Stanford Institute for Economic Policy Research.
  18. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Levine's Bibliography 843644000000000184, UCLA Department of Economics.
  19. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  20. Block, C.A. & Collins, J. & Ketter, W. & Weinhardt, C., 2009. "A Multi-Agent Energy Trading Competition," ERIM Report Series Research in Management ERS-2009-054-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus Uni.
  21. Crescenzio Gallo & Giancarlo De Stasio & Cristina Di Letizia, 2006. "A Data Set Generation Algorithm in Combinatorial Auctions," Quaderni DSEMS 01-2006, Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia.
  22. Ron Lavi & Ahuva Mu’alem & Noam Nisan, 2009. "Two simplified proofs for Roberts’ theorem," Social Choice and Welfare, Springer, vol. 32(3), pages 407-423, March.
  23. Song, Jiongjiong & Regan, Amelia C & Nandiraju, Srinivas, 2008. "A Bid Analysis Model with Business Constraints for Transportation Procurement Auctions," University of California Transportation Center, Working Papers qt5766c7r1, University of California Transportation Center.
  24. Debasis Mishra & Abdul Quadir, 2012. "Deterministic single object auctions with private values," Indian Statistical Institute, Planning Unit, New Delhi Discussion Papers 12-06, Indian Statistical Institute, New Delhi, India.
  25. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  26. Ariane Lambert-Mogiliansky & Konstantin Sonin, 2005. "Collusive market-sharing and corruption in procurement," Working Papers halshs-00590773, HAL.
  27. Mark Bykowsky & Jonathan Levy & William Sharkey & Tracy Waldon & Simon Wilkie, 2003. "Economic Analysis at the Federal Communications Commission," Review of Industrial Organization, Springer, vol. 23(2), pages 157-174, September.
  28. Regan, A C & Song, Jiongjiong, 2003. "Combinatorial Auctions for Transportation Service Procurement: The Carrier Perspective," University of California Transportation Center, Working Papers qt7sq003mj, University of California Transportation Center.
  29. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  30. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
  31. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Discussion Paper Series dp452, The Center for the Study of Rationality, Hebrew University, Jerusalem.
  32. Chevaleyre, Yann & Endriss, Ulle & Maudet, Nicolas, 2006. "Tractable Negotiation in Tree-structured Domains," Economics Papers from University Paris Dauphine 123456789/5665, Paris Dauphine University.
  33. Song, Jiongjiong & Regan, Amelia C. & Nandiraju, Srinivas, 2008. "A Bid Analysis Model with Business Constraints for Transportation Procurement Auctions," University of California Transportation Center, Working Papers qt24817929, University of California Transportation Center.