Market Good Flexibility in Capacity Auctions
dc.contributor.author | Hall, Nicholas G. | en_US |
dc.contributor.author | Liu, Zhixin | en_US |
dc.date.accessioned | 2013-04-08T20:50:00Z | |
dc.date.available | 2014-05-01T14:28:26Z | en_US |
dc.date.issued | 2013-03 | en_US |
dc.identifier.citation | Hall, 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.issn | 1059-1478 | en_US |
dc.identifier.issn | 1937-5956 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/97251 | |
dc.publisher | I‐Tech Education and Publishing | en_US |
dc.publisher | Wiley Periodicals, Inc. | en_US |
dc.subject.other | Capacity Allocation | en_US |
dc.subject.other | Market Good Flexibility | en_US |
dc.subject.other | Noncooperative Game | en_US |
dc.subject.other | Auction | en_US |
dc.title | Market Good Flexibility in Capacity Auctions | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Industrial and Operations Engineering | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/97251/1/poms1355.pdf | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/97251/2/poms1355-sup-0001-AppendixS1.pdf | |
dc.identifier.doi | 10.1111/j.1937-5956.2012.01355.x | en_US |
dc.identifier.source | Production and Operations Management | en_US |
dc.identifier.citedreference | Pinedo, M. 2012. Scheduling, Theory, Algorithms and Systems, 4th edn. Springer, New York. | en_US |
dc.identifier.citedreference | Kubzin, M. A., V. A. Strusevich. 2006. Planning machine maintenance in two‐machine shop scheduling. Oper. Res. 54 ( 4 ): 789 – 800. | en_US |
dc.identifier.citedreference | Kunreuther, 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.citedreference | Kutanoglu, 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.citedreference | McAfee, R. P., T. R. Lewis 2009. Introduction to Economic Analysis. Flat World Knowledge, Irvington, NY. | en_US |
dc.identifier.citedreference | McAfee, R. P., J. McMillan. 1987. Auctions and bidding. J. Econ. Lit. 25 ( 2 ): 699 – 738. | en_US |
dc.identifier.citedreference | NASA. 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.citedreference | Rassenti, S. J. 1982. A combinatorial auction mechanism for airport time slot allocation. Bell J. Econ. 13 ( 2 ): 402 – 417. | en_US |
dc.identifier.citedreference | Reddy, S. K., J. E. Aronson, A. Stam. 1998. SPOT: Scheduling programs optimally for television. Manage. Sci. 44 ( 1 ): 83 – 102. | en_US |
dc.identifier.citedreference | Reeves, 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.citedreference | Rothkopf, M. 2007. Decision analysis: The right tool for auctions. Decision Analysis 4 ( 3 ): 167 – 172. | en_US |
dc.identifier.citedreference | Sandholm, 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.citedreference | Shaw, 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.citedreference | Shaw, 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.citedreference | Shen, 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.citedreference | Sutherland, I. E. 1968. A futures market in computer time. Commun. ACM 11 ( 6 ): 449 – 451. | en_US |
dc.identifier.citedreference | Talluri, K. T., G. J. van Ryzin. 2004. The Theory and Practice of Revenue Management. Kluwer Academic Publishers, Norwell, MA. | en_US |
dc.identifier.citedreference | Varian, H. R., J. K. MacKie‐Mason. 1994. Generalized Vickrey auctions. Report, Department of Economics, University of Michigan, Ann Arbor, MI. | en_US |
dc.identifier.citedreference | Wellman, 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.citedreference | Agnetis, 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.citedreference | Agnetis, A., D. Pacciarelli, A. Pacifici. 2007. Multi‐agent single machine scheduling. Annals Oper. Res. 150 ( 1 ): 3 – 15. | en_US |
dc.identifier.citedreference | Agnetis, 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.citedreference | Arbib, 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.citedreference | Arkin, 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.citedreference | Ball, 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.citedreference | Brewer, 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.citedreference | Brucker, P. 1998. Scheduling Algorithms, 2nd edn. Springer, Berlin, Germany. | en_US |
dc.identifier.citedreference | Cheng, 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.citedreference | Clearwater, S. H., ed. 1996. Market‐Based Control: A Paradigm for Distributed Resource Allocation. World Scientific, Hackensack, NJ. | en_US |
dc.identifier.citedreference | Computech. 2011. Spectrum auctions at the FCC. Available at http://www.computechinc.com/experience/federal/spectrumauctions (accessed date October 20, 2011). | en_US |
dc.identifier.citedreference | Cramton, P. 1998. Ascending auctions. Eur. Econ. Rev. 42 ( 3–5 ): 745 – 756. | en_US |
dc.identifier.citedreference | Curiel, 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.citedreference | Curiel, I., G. Pederzoli, S. Tijs 1989. Sequencing games. Eur. J. Oper. Res. 40 ( 3 ): 344 – 351. | en_US |
dc.identifier.citedreference | Curiel, I., J. Potters, R. Prasad, S. Tijs, B. Veltman. 1994. Sequencing and cooperation. Oper. Res. 42 ( 3 ): 566 – 568. | en_US |
dc.identifier.citedreference | Davidsson, 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.citedreference | Derrien, 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.citedreference | Dewan, 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.citedreference | Federal Communications Commission. 1998. Federal communications commission: All about auctions. Report, Federal Communications Commission Wireless Telecommunications Bureau, Washington, DC. | en_US |
dc.identifier.citedreference | Financialexpress. 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.citedreference | Geng, 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.citedreference | Google 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.citedreference | Hall N. G., Z. Liu. 2010. On auction protocols for decentralized scheduling. Games and Econ Behav. 72 ( 2 ): 583 – 585. | en_US |
dc.identifier.citedreference | Hall, 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.citedreference | Huang, 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.citedreference | Industry 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.citedreference | Karabati, 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.citedreference | Krishna, V. 2002. Auction Theory. Academic Press, St. Louis, MO. | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
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.