IDEAS home Printed from https://ideas.repec.org/r/eee/jetheo/v147y2012i3p999-1034.html
   My bibliography  Save this item

Combinatorial agency

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. 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.
  2. Balmaceda, Felipe, 2018. "Optimal task assignments with loss-averse agents," European Economic Review, Elsevier, vol. 105(C), pages 1-26.
  3. Balmaceda, Felipe, 2016. "Optimal task assignments," Games and Economic Behavior, Elsevier, vol. 98(C), pages 1-18.
  4. Lunander, Anders & Lundberg, Sofia, 2009. "Do Combinatorial Procurement Auctions Lower Cost? - An Empirical Analysis of Public Procurement of Multiple Contracts," Umeå Economic Studies 776, Umeå University, Department of Economics, revised 16 Sep 2009.
  5. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions II: Ascending Auctions," Discussion Paper Series dp382, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  6. Itai Sher, 2012. "Optimal shill bidding in the VCG mechanism," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 50(2), pages 341-387, June.
  7. Goossens, D.R. & Müller, R.J. & Spieksma, F.C.R., 2007. "Matrix bids in combinatorial auctions: expressiveness and micro-economic properties," Research Memorandum 016, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  8. Yigal Gerchak & Christian Schmid, 2022. "Principal–agent models where a principal is only affected by extreme performances," Managerial and Decision Economics, John Wiley & Sons, Ltd., vol. 43(2), pages 468-477, March.
  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, vol. 4(4), pages 1-21, November.
  10. Ariane Lambert‐Mogiliansky & Konstantin Sonin, 2006. "Collusive Market Sharing and Corruption in Procurement," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 15(4), pages 883-908, December.
  11. Mark Bykowsky & Jonathan Levy & William Sharkey & Tracy Waldon & Simon Wilkie, 2003. "Economic Analysis at the Federal Communications Commission," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 23(2), pages 157-174, September.
  12. , & ,, 2013. "Implementation in multidimensional dichotomous domains," Theoretical Economics, Econometric Society, vol. 8(2), May.
  13. Ilan Nehama, 2013. "Complexity of Optimal Lobbying in Threshold Aggregation," Discussion Paper Series dp642, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  14. Nora, Vladyslav & Winter, Eyal, 2024. "Exploiting social influence in networks," Theoretical Economics, Econometric Society, vol. 19(1), January.
  15. Müller, Rudolf, 2001. "Auctions - the Big Winner Among Trading Mechanisms for the Internet Economy," Research Memorandum 015, Maastricht University, Maastricht Economic Research Institute on Innovation and Technology (MERIT).
  16. Paul Milgrom, 2009. "Assignment Messages and Exchanges," American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
  17. Ron Lavi & Ahuva Mu’alem & Noam Nisan, 2009. "Two simplified proofs for Roberts’ theorem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(3), pages 407-423, March.
  18. 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.
  19. 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.
  20. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Levine's Bibliography 843644000000000184, UCLA Department of Economics.
  21. Martin Bichler & Alexander Pikovsky & Thomas Setzer, 2009. "An Analysis of Design Problems in Combinatorial Procurement Auctions," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 1(1), pages 111-117, February.
  22. repec:dau:papers:123456789/5665 is not listed on IDEAS
  23. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
  24. Jawad Abrache & Teodor Gabriel Crainic & Michel Gendreau, 2002. "Models for Bundle Trading in Financial Markets," CIRANO Working Papers 2002s-84, CIRANO.
  25. Blumrosen, Liad & Feldman, Michal, 2013. "Mechanism design with a restricted action space," Games and Economic Behavior, Elsevier, vol. 82(C), pages 424-443.
  26. Yuval Emek & Michal Feldman, 2007. "Computing an Optimal Contract in Simple Technologies," Discussion Paper Series dp452, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  27. 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.
  28. Liad Blumrosen & Noam Nisan, 2005. "On the Computational Power of Iterative Auctions I: Demand Queries," Discussion Paper Series dp381, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  29. Guru Guruganesh & Yoav Kolumbus & Jon Schneider & Inbal Talgam-Cohen & Emmanouil-Vasileios Vlatakis-Gkaragkounis & Joshua R. Wang & S. Matthew Weinberg, 2024. "Contracting with a Learning Agent," Papers 2401.16198, arXiv.org.
  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. Ramchurn, Sarvapali D. & Dash, Rajdeep K. & Jennings, Nicholas R. & Giovannucci, Andrea & Rodriguez-Aguilar, Juan A. & Mezzetti, Claudio, 2008. "Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty," Economic Research Papers 269891, University of Warwick - Department of Economics.
  32. Block, C. & 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 University Rotterdam.
  33. 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.
  34. 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.
  35. Müller, R.J. & Perea ý Monsuwé, A. & Wolf, S., 2007. "Combinatorial scoring auctions," Research Memorandum 020, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  36. Lawrence M. Ausubel & Paul Milgrom, 2004. "Ascending Proxy Auctions," Discussion Papers 03-035, Stanford Institute for Economic Policy Research.
  37. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  38. Johannes C. Müller & Sebastian Pokutta & Alexander Martin & Susanne Pape & Andrea Peter & Thomas Winter, 2017. "Pricing and clearing combinatorial markets with singleton and swap orders," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(2), pages 155-177, April.
  39. Shahar Dobzinski & Noam Nisan & Michael Schapira, 2005. "Truthful Randomized Mechanisms for Combinatorial Auctions," Discussion Paper Series dp408, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
  40. Balmaceda, Felipe & Balseiro, Santiago R. & Correa, José R. & Stier-Moses, Nicolás E., 2016. "Bounds on the welfare loss from moral hazard with limited liability," Games and Economic Behavior, Elsevier, vol. 95(C), pages 137-155.
  41. 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.
  42. 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.
  43. Ariane Lambert‐Mogiliansky & Konstantin Sonin, 2006. "Collusive Market Sharing and Corruption in Procurement," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 15(4), pages 883-908, December.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.