View Item 

Show simple item record

Market Good Flexibility in Capacity Auctions

dc.contributor.authorHall, Nicholas G.en_US
dc.contributor.authorLiu, Zhixinen_US
dc.date.accessioned2013-04-08T20:50:00Z
dc.date.available2014-05-01T14:28:26Zen_US
dc.date.issued2013-03en_US
dc.identifier.citationHall, Nicholas G.; Liu, Zhixin (2013). "Market Good Flexibility in Capacity Auctions." Production and Operations Management 22(2): 459-472. <http://hdl.handle.net/2027.42/97251>en_US
dc.identifier.issn1059-1478en_US
dc.identifier.issn1937-5956en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/97251
dc.publisherI‐Tech Education and Publishingen_US
dc.publisherWiley Periodicals, Inc.en_US
dc.subject.otherCapacity Allocationen_US
dc.subject.otherMarket Good Flexibilityen_US
dc.subject.otherNoncooperative Gameen_US
dc.subject.otherAuctionen_US
dc.titleMarket Good Flexibility in Capacity Auctionsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelIndustrial and Operations Engineeringen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/97251/1/poms1355.pdf
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/97251/2/poms1355-sup-0001-AppendixS1.pdf
dc.identifier.doi10.1111/j.1937-5956.2012.01355.xen_US
dc.identifier.sourceProduction and Operations Managementen_US
dc.identifier.citedreferencePinedo, M. 2012. Scheduling, Theory, Algorithms and Systems, 4th edn. Springer, New York.en_US
dc.identifier.citedreferenceKubzin, M. A., V. A. Strusevich. 2006. Planning machine maintenance in two‐machine shop scheduling. Oper. Res. 54 ( 4 ): 789 – 800.en_US
dc.identifier.citedreferenceKunreuther, H., P. R. Kleindorfer. 1986. A sealed‐bid auction mechanism for siting noxious facilities. The Am. Econ. Rev. 76 ( 2 ): 295 – 299.en_US
dc.identifier.citedreferenceKutanoglu, E., S. D. Wu. 1999. On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Trans. 31 ( 9 ), 813 – 826.en_US
dc.identifier.citedreferenceMcAfee, R. P., T. R. Lewis 2009. Introduction to Economic Analysis. Flat World Knowledge, Irvington, NY.en_US
dc.identifier.citedreferenceMcAfee, R. P., J. McMillan. 1987. Auctions and bidding. J. Econ. Lit. 25 ( 2 ): 699 – 738.en_US
dc.identifier.citedreferenceNASA. 2008. Game theoretic scheduling of the deep space network. Available at http://ti.arc.nasa.gov/tech/project/details.php?pid= 236&gid= 8&ta= 2 (accessed date January 3, 2011).en_US
dc.identifier.citedreferenceRassenti, S. J. 1982. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econ. 13 ( 2 ): 402 – 417.en_US
dc.identifier.citedreferenceReddy, S. K., J. E. Aronson, A. Stam. 1998. SPOT: Scheduling programs optimally for television. Manage. Sci. 44 ( 1 ): 83 – 102.en_US
dc.identifier.citedreferenceReeves, D. M., M. P. Wellman, J. K. MacKie‐Mason, A. Osepayshvili. 2005. Exploring bidding strategies for market‐based scheduling. Decision Support Systems 39 ( 1 ): 67 – 85.en_US
dc.identifier.citedreferenceRothkopf, M. 2007. Decision analysis: The right tool for auctions. Decision Analysis 4 ( 3 ): 167 – 172.en_US
dc.identifier.citedreferenceSandholm, T., S. Suri, A. Gilpin. 2005. CABOB: A fast optimal algorithm for winner determination in combinatorial auctions. Manage. Sci. 51 ( 3 ): 374 – 390.en_US
dc.identifier.citedreferenceShaw, M. J. 1987. A distributed scheduling method for computer integrated manufacturing: The use of local area networks in cellular‐systems. Int. J. Prod. Res. 25 ( 9 ): 1285 – 1303.en_US
dc.identifier.citedreferenceShaw, M. J. 1988. Dynamic scheduling in cellular manufacturing systems: A framework for networked decision‐making. J. Manuf. Systems 7 ( 2 ): 83 – 94.en_US
dc.identifier.citedreferenceShen, W., Q. Hao, H.‐J. Yoon, D. H. Norrie. 2006. Applications of agent‐based systems in intelligent manufacturing: An updated review. Adv. Eng. Inform. 20 ( 4 ): 415 – 431.en_US
dc.identifier.citedreferenceSutherland, I. E. 1968. A futures market in computer time. Commun. ACM 11 ( 6 ): 449 – 451.en_US
dc.identifier.citedreferenceTalluri, K. T., G. J. van Ryzin. 2004. The Theory and Practice of Revenue Management. Kluwer Academic Publishers, Norwell, MA.en_US
dc.identifier.citedreferenceVarian, H. R., J. K. MacKie‐Mason. 1994. Generalized Vickrey auctions. Report, Department of Economics, University of Michigan, Ann Arbor, MI.en_US
dc.identifier.citedreferenceWellman, M. P., W. E. Walsh, P. R. Wurman, J. K. MacKie‐Mason. 2001. Auction protocols for decentralized scheduling. Games Econ. Behav. 35 ( 1–2 ): 271 – 303.en_US
dc.identifier.citedreferenceAgnetis, A., P. B. Mirchandani, D. Pacciarelli, A. Pacifici. 2004. Scheduling problems with two competing agents. Oper. Res. 52 ( 2 ): 229 – 242.en_US
dc.identifier.citedreferenceAgnetis, A., D. Pacciarelli, A. Pacifici. 2007. Multi‐agent single machine scheduling. Annals Oper. Res. 150 ( 1 ): 3 – 15.en_US
dc.identifier.citedreferenceAgnetis, A., D. Pacciarelli, A. Pacifici. 2008. Combinatorial models for multi‐agent scheduling problems. E. Levner, ed. Multiprocessor Scheduling: Theory and Applications. I‐Tech Education and Publishing, Vienna, Austria, 21 – 46.en_US
dc.identifier.citedreferenceArbib, C., S. Smriglio, M. Servilio. 2004. A competitive scheduling problem and its relevance to UMTS channel assignment. Networks 44 ( 2 ): 132 – 141.en_US
dc.identifier.citedreferenceArkin, E. M., E. B. Silverberg 1987. Scheduling jobs with fixed start and end times. Discrete Appl. Math 18 ( 1 ): 1 – 8.en_US
dc.identifier.citedreferenceBall, M., G. L. Donohue, K. Hoffman. 2006. Auctions for the safe, efficient and equitable allocation of airspace system resources. P. Cramton, Y. Shoham, R. Steinberg, eds. Combinatorial Auctions. MIT Press, Cambridge, MA, 507 – 538.en_US
dc.identifier.citedreferenceBrewer, P. J., C. R. Plott. 1996. A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks. Int. J. Ind. Organ. 14 ( 6 ): 857 – 886.en_US
dc.identifier.citedreferenceBrucker, P. 1998. Scheduling Algorithms, 2nd edn. Springer, Berlin, Germany.en_US
dc.identifier.citedreferenceCheng, T. C. E., C. T. Ng, J. J. Yuan. 2006. Multi‐agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theor. Comput. Sci. 362 ( 1–3 ): 273 – 281.en_US
dc.identifier.citedreferenceClearwater, S. H., ed. 1996. Market‐Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, Hackensack, NJ.en_US
dc.identifier.citedreferenceComputech. 2011. Spectrum auctions at the FCC. Available at http://www.computechinc.com/experience/federal/spectrumauctions (accessed date October 20, 2011).en_US
dc.identifier.citedreferenceCramton, P. 1998. Ascending auctions. Eur. Econ. Rev. 42 ( 3–5 ): 745 – 756.en_US
dc.identifier.citedreferenceCuriel, I., H. Hamers, F. Klijn. 2002. Sequencing games: A survey. P. Borm, H. Peters, eds. Chapters in Game Theory: In Honor of Stef Tijs. Kluwer Academic Publishers, Boston, MA, 27 – 50.en_US
dc.identifier.citedreferenceCuriel, I., G. Pederzoli, S. Tijs 1989. Sequencing games. Eur. J. Oper. Res. 40 ( 3 ): 344 – 351.en_US
dc.identifier.citedreferenceCuriel, I., J. Potters, R. Prasad, S. Tijs, B. Veltman. 1994. Sequencing and cooperation. Oper. Res. 42 ( 3 ): 566 – 568.en_US
dc.identifier.citedreferenceDavidsson, P., L. Henesey, L. Ramstedt, J. Tornquist, F. Wernstedt. 2005. An analysis of agent‐based approaches to transport logistics. Transport. Res., Part C 13 ( 4 ): 255 – 271.en_US
dc.identifier.citedreferenceDerrien, F., K. L. Womack. 2003. Auctions vs. bookbuilding and the control of underpricing in hot IPO markets. Rev. Finan Stud. 16 ( 1 ), 31 – 61.en_US
dc.identifier.citedreferenceDewan, P., S. Joshi. 2002. Auction‐based distributed scheduling in a dynamic job shop environment. Int. J. Prod. Res. 40 ( 5 ): 1173 – 1191.en_US
dc.identifier.citedreferenceFederal Communications Commission. 1998. Federal communications commission: All about auctions. Report, Federal Communications Commission Wireless Telecommunications Bureau, Washington, DC.en_US
dc.identifier.citedreferenceFinancialexpress. 2007. Panel seeks views on e‐auction, coal distribution by Jan 29. Available at http://www.financialexpress.com/news/panel-seeks-views-on-eauction-coal-distribution-byjan-29/191771/ (accessed date October 20, 2011).en_US
dc.identifier.citedreferenceGeng, J., R. H. Kwon, J. C. Beck. 2006. A combinatorial auction‐based heuristic for minimizing total weighted tardiness in job shop scheduling. Working paper, University of Toronto, Ontario, Canada.en_US
dc.identifier.citedreferenceGoogle Display Network. 2011. Creativity at the right place and right time delivers measurable results. Available at http://www.google.com/intl/en/ads/displaynetwork/ (accessed date October 20, 2011).en_US
dc.identifier.citedreferenceHall N. G., Z. Liu. 2010. On auction protocols for decentralized scheduling. Games and Econ Behav. 72 ( 2 ): 583 – 585.en_US
dc.identifier.citedreferenceHall, N. G., M. E. Posner. 2001. Generating experimental data for computational testing with machine scheduling applications. Oper. Res. 49 ( 6 ): 854 – 865.en_US
dc.identifier.citedreferenceHuang, S., H. Chen, L.‐J. Zhang. 2005. Progressive auction based resource allocation in service‐oriented architecture. Proceedings of the 2005 IEEE International Conference on Services Computing (SCC’05), 2, 85 – 92.en_US
dc.identifier.citedreferenceIndustry Canada. 2007. Licensing framework for the auction for spectrum licenses for advanced wireless services and other spectrum in the 2 GHz range. White paper, Industry Canada, Ottawa, Ontario, Canada.en_US
dc.identifier.citedreferenceKarabati, S. 2010. Pricing and scheduling with multiple products and non‐cooperative agents. Working paper, College of Administrative Sciences and Economics, Koç University, Istanbul, Turkey.en_US
dc.identifier.citedreferenceKrishna, V. 2002. Auction Theory. Academic Press, St. Louis, MO.en_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
poms1355.pdf
Size:
207.1KB
Format:
PDF
View/Open
Name:
poms1355-sup-0001-AppendixS1.pdf
Size:
198.4KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.