1.石豐宇、謝正宏(2009),「應用賽局理論研擬高速鐵路通車後之國道客運競爭策略」,運輸計劃季刊,第三十八卷,第一期,頁69-83。2.李克聰、李睿玟、蔡冉慧、郭淑慈(1997),「由計程車的權利與義務談如何提升其成為良好可靠的運輸工具」,都市交通,94期,頁43-51。3.李克聰、蕭易呈、何光鎧、陳嘉良(2002),捷運共乘接駁計程車可行性之研究,逢甲大學交通工程與管理學系專題報告。
4.李欣育(2009),消費者選擇計程車共乘行為意向之研究,中央警察大學交通學系碩士論文。
5.李風聖、吳云亭(1995),公平與效率---制度分析,經濟科學出版社。
6.何依栖(1989),「都會區計程車共乘制度實施及管理之探討」,運輸計劃季刊,第18 卷,第4 期,頁507-518。7.呂英志(2002),即時資訊下車輛路線問題之研究,逢甲大學交通工程與管理研究所碩士論文。8.吳沛儒(2004),任務型共乘接駁計程車之規劃與設計,逢甲大學交通工程與管理學系碩士班碩士論文。9.林瑜芳(2008),小汽車共乘公平性配對模式暨求解演算法之研究,中央大學土木工程學系碩士論文。10.林繼國等人(2001),計程車分類與費率結構合理化之研究,交通部運輸研究所、汎誠科技有限公司合作辦理。
11.周文生等(2006),九十五年度臺北地區計程車營運情形調查,臺北縣市政府交通局委託中華民國運輸學會。
12.洪玉輔(2001),計程車費率實施差別定價之研究,交通大學交通運輸研究所碩士論文。13.張堂賢(1992),「都會區計程車運輸市場及其訂價研究」,運輸計劃季刊,第21卷,第一期,頁63-94。14.張堂賢、孫桂英(1997),「彈性起跳運價的計程車市場變革探討」,都市交通,第94期,頁52-58。15.張學孔(1993),「計程車運價訂定原理與計費方案分析」,都市交通,第70期,頁23-28。16.張學孔、凃保民(1994),「計程車計時收費之研究」,運輸計劃季刊,第二十三卷,第三期,頁273-288。17.張學孔、黃世民(2003),「計程車最適費率與空車率之研究」,運輸計劃季刊,第三十二卷,第二期,頁341-364。
18.張學孔、郭瑜堅(2007),「都市旅次總成本模式構建之研究」,運輸計劃季刊,第三十六卷,第二期,頁147-182。19.張學孔等(2008),97年度台北地區計程車營運情形調查,台北縣、市政府交通局委託中華民國運輸學會辦理專題報告。
20.許志安(2007),計程車配對共乘之需求預測與績效分析-以內湖科學園區為例,淡江大學運輸管理學系運輸科學碩士班碩士論文。
21.梁蕙嬿(1997),臺北地區計程車差別定價可行性分析,交通大學交通運輸研究所碩士論文。
22.黃台生、許采蘋(2006),計程車共乘與撥招計程車可行條件之研究,第十四屆海峽兩岸都市交通學術研討會。
23.黃承傳、蔡義清、洪玉輔(2003),「計程車分級定價之研究」,運輸學刊,第15 卷,第2 期,頁207-225。24.邱盛生等人(1989),機場計程車服務收費及其管理之研究,交通部運輸研究所。
25.覃運梅、石琴(2006),「出租車核乘模式的探討」,合肥工業大學學報(自然科學版)。
26.陳正芳(2003),應用禁忌搜尋法於混合送收貨之車輛途程問題,逢甲大學工業工程研究所碩士論文。
27.陳亭羽(2002),運具選擇之能力集合分析及其在大眾捷運之應用,國立交通大學土木工程研究所碩士論文。28.陳信諺(2008),計程車共乘及旅客配對整合模式暨求解演算法之研究,中央大學土木工程學系碩士論文。29.陶治中、張勝雄、石豐宇、邱顯明等(2005),智慧型運輸系統應用於高乘載計畫之示範與建置-都會區共乘系統之示範與建置,交通部委託淡江大學辦理專題研究報告。
30.藍武王(1995),臺北地區計程車營運情形調查,台北市政府交通局委託交通大學交通運輸研究所辦理專題研究報告,頁223-251.
31.藍武王、周文生、邱裕鈞(1997),「智慧型計程車計費器之系統規劃:IC卡技術之應用」,都市交通,94期,頁6-15。32.Ardekani, S. A., Jamei, B. and Herman, R. (1986), “A Taxicab Fare Policy Formula Based on Fuel Consumption Observation,” Transportation Research Record, Vol. 1103, pp. 33-39.
33.Aumann, R. J. and Shapley, L. S. (1974), Values of Non-Atomic Games, Princeton University Press.
34.Balachandran, B. V. and Ramakrishnan, T. S. (1981), “Joint Cost Allocation: A Unified Approach,” The Accounting Review, Vol. 56, No. 1.
35.Barron, E.N. (2008), Game Theory: An Introduction, John Wiley & Sons. Incorporation.
36.Bektas, T. (2006), “The Multiple Traveling Salesman Problem: An Overview of Formulation and Solution Procedures,” Omega International Journal of Management Science, Vol. 34, pp. 209-219.
37.Brams, S. J. (2005), Fair Division, Oxford Handbook of Political Economy.
38.Butler, M. and Williams, H. P. (2002), “The Allocation of Shared Fixed Costs,” The London School of Economics and Political Science (LSE Research Online).
39.Chang S. K. and Chu, C. H. (2009), “Welfare-Maximized Vacancy and Subsidy Rates with Maximum Social Willingness-to-Pay under Log-linear Demand for a Cruising Taxi Market,” Transportation Research Record. (Forthcoming, SCI, EI)
40.Dixit, A. K. (2002),「策略的賽局」(藍兆杰、徐偉傑及陳怡君譯),弘智文化出版社。
41.Edelman, P. H. and Fishburn, P. C. (2001), “Fair Division of Indivisible Items among People with Similar Preferences,” Mathematical Social Sciences, Vol. 41, pp. 327-347.
42.Fagin, R. and Williams, J. H. (1983), “A Fair Carpool Scheduling Algorithm,” IBM Journal Research Development, Vol. 27, No. 2, pp. 133-139.
43.Ghahraman, D., Au, T. and Bauman, D. M. B. (1975), “Analysis of Metered Taxi Fares,” Transportation Engineering Journal, Vol.101, No.4, 807-816.
44.Hamlen, S. S., Hamlen, W.A. and Tschirhart, J. T. (1977), “The Use of Core Theory in Evaluating Joint Cost Allocation Schemes,” The Accounting Review, Vol. 52, pp. 616-627.
45.Hart, S. (2006), “Robert Aumman`s Game and Economic Theory,” Scandinavian Journal of Economics, Vol. 108, No. 2, pp. 185–211.
46.Lightfoot, J. M. (1993), “An Algorithm for Sharing Costs of Operating a Computer Network,” OMEGA International Journal of Management Science, Vol. 21, No. 5, pp. 585-592.
47.Louderback, D. L. (1976), “Another Approach to Allocating Joint Costs: A Comment,”The Accounting Review, pp. 683-685.
48.Miller, C.E., Tucker A.W. and Zemlin, R.A. (1960), “Integer Programming Formulation of Traveling Salesman Problems,” Journal of Association for Computing Machinery, Vol. 7, pp. 326-329.
49.Moriarity, S. (1975), “Another Approach to Allocating Joint Costs,”The Accounting Review, pp.791-795.
50.Naor, M. (2005), “On Fairness in the Carpool Problem,” Journal of Algorithm, Vol. 55, No. 1, pp. 93-98.
51.Pigou, A. C. (1920), The Economics of Welfare, 4th ed. London: Macmillan.
52.Psaraftis, H. N. (1980), “A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem,” Transportation Science, Vol. 14, No. 2, pp. 130-154.
53.Rawls, J. (edited by Erin, K.) (2001), Justice as fairness: A Restatement, The Belknap Press of Harvard University Press.
54.Ropke, S. (2009), “Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows,” Transportation Science, Vol. 43, No. 3, pp. 267-286.
55.Serrano, R. (2007), “Cooperative Game: Core and Shapley Value,” Encyclopedia of Complexity and Systems Science.
56.Shapley, L. S. (1953), “The Value of an N-Person Game,” In Contributions to the Theory of Games, edited by H. W. Kuhn and A. W. Tucker. Princeton, N. J.; Princeton University Press.
57.Shapley, L.S. and Shubik, M. (1954), “A Method for Evaluating the Distribution of Power in a Committee System,” American Political Science Review, Vol. 48, pp. 787-792.
58.Shubik, M. (1962), “Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing,” Management Science, Vol. 8, No. 3, pp. 325-343. 58.Thieme, H. J. (1992),「西德經濟奇蹟的背後---社會福利市場經濟解讀」(吳妙善譯),月旦出版社。
59.Young, H. P. (1985), “Cost Allocation,” Proceedings of Symposia in Applied Mathematics, Volume 33, pp. 69-94.