Bargaining on networks: An experiment

While markets are often decentralized, in many other cases agents in one role can only negotiate with a proper subset of the agents in the complementary role. There may be proximity issues or restricted communication flows. For example, information may be transmitted only through word-of-mouth, as is often the case for job openings, business opportunities, and confidential transactions. Bargaining can be considered to occur over a network that summarizes the structure of linkages among people. We conduct an alternating-offer bargaining experiment using separate simple networks, which are then joined during the session by an additional link. The results diverge sharply depending on how this connection is made. Payoffs can be systematically affected even for agents who are not connected by the new link. We use a graph-theoretic analysis to show that any two-sided network can be decomposed into simple networks of three types, so that our result can be generalized to more complex bargaining environments. Participants appear to grasp the essential characteristics of the networks and we observe a rather consistently high level of bargaining efficiency.

GO! Explore the World of Transportation, January - February 2007

Newsletter produced by the Iowa Department of Transport.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Infrastructure and Transportation Task Force Report, August 2008

The Rebuild Iowa Infrastructure and Transportation Task Force is acutely aware of the critical role infrastructure plays in Iowa’s communities, the lives of the residents, and the economic well-being of the state. With encouragement to the Rebuild Iowa Advisory Commission (RIAC) for its consideration of great need for infrastructure and transportation repairs, the Task Force provides its assessment and recommendations. As the RIAC fulfills its obligations to guide the recovery and reconstruction in Iowa, infrastructure and transportation must be recognized for its impact on all Iowans. The tornadoes, storms, and floods were devastating to infrastructure and transportation systems across the state. The damage did not distinguish between privately-owned and public assets. The significance of the damage emerges further with the magnitude of the damage estimates. Infrastructure includes components that some might initially overlook, such as communication systems, landfills, and water treatment. The miles of damaged roads and bridges are more evident to many Iowans. Given the reliance on infrastructure systems, many repairs are already underway, though gaps have emerged in the funding for repairs to certain infrastructure systems.

Department of Transportation Performance Plan, FY 2009

Agency Performance Plan

Iowa Department of Transportation, Strategic Plan, 2008-2012, 2008

This report outlines the strategic plan for Department of Transportation, goals and mission.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Emergence of Cooperation on Static and Dynamic Networks

Game theory is a branch of applied mathematics used to analyze situation where two or more agents are interacting. Originally it was developed as a model for conflicts and collaborations between rational and intelligent individuals. Now it finds applications in social sciences, eco- nomics, biology (particularly evolutionary biology and ecology), engineering, political science, international relations, computer science, and philosophy. Networks are an abstract representation of interactions, dependencies or relationships. Net- works are extensively used in all the fields mentioned above and in many more. Many useful informations about a system can be discovered by analyzing the current state of a network representation of such system. In this work we will apply some of the methods of game theory to populations of agents that are interconnected. A population is in fact represented by a network of players where one can only interact with another if there is a connection between them. In the first part of this work we will show that the structure of the underlying network has a strong influence on the strategies that the players will decide to adopt to maximize their utility. We will then introduce a supplementary degree of freedom by allowing the structure of the population to be modified along the simulations. This modification allows the players to modify the structure of their environment to optimize the utility that they can obtain.

Electronic Payments for Driver's Licensing Transactions,December 31, 2008

House File 2196 required the Department of Transportation (DOT) to study the acceptance of electronic payments at its customer service sites and sites operated by county treasurers. Specifically the legislation requires the following: “The department of transportation shall review the current methods the department employs for the collection of fees and other revenues at sites operated by county treasurers under chapter 321M and at customer service sites operated by the department. In conducting its review, the department, in cooperation with the treasurer of state, shall consider providing an electronic payment option for all of its customers. The department shall report its findings and recommendations by December 31, 2008, to the senate and house standing committees on transportation regarding the advantages and disadvantages of implementing one or more electronic payment systems.” This review focused on estimating the costs of providing an electronic payment option for customers of the DOT driver’s license stations and those of the 81 county treasurers. Customers at these sites engage in three primary financial transactions for which acceptance of electronic payments was studied: paying for a driver’s license (DL), paying for a non-operator identification card (ID), and paying certain civil penalties. Both consumer credit cards and PIN-based debit cards were reviewed as electronic payment options. It was assumed that most transactions would be made using a consumer credit card. Credit card companies charge a fee for each transaction for which they are used. The amount of these fees varies among credit card companies. The estimates for credit card fees used in this study were based on the State Treasurer of Iowa’s current credit card contract, which is due to expire in September 2009. Since credit card companies adjust their fees each year, estimates were based on the 2008 fee schedule. There is also a fee for the use of PIN-based debit cards. The estimates for PIN-based debit card transactions were based on information provided by Wells Fargo Merchant Services for current fees charged by debit card networks. Credit and debit card transactions would be processed through vendor-provided hardware and software. The costs would be determined through the competitive bidding process since several vendors provide this function; therefore, these costs are not reflected in this document.

Multinationals, technology networks and international takeovers

We formulate a knowlegde--based model of direct investment through mergers and acquisitions. M&As are realized to create comparative advantages by exploiting international synergies and appropriating local technology spillovers requiring geographical proximity, but can also represent a strategic response to the presence of a multinational rival. The takeover fee paid tends to increase with the strength of local spillovers which can thus work against multinationalization. Seller's bargaining power increases the takeover fee, but does not influence the investment decision. We characterize losers and winners from multinationalization, and show that foreign investment stimulates research but could result in a synergy trap reducing multinationals' profits.

Iowa Department of Transportation, Strategic Plan, 2008-2012,[revised, final], 2008

This report outlines the strategic plan for Department of Transportation, goals and mission.

Iowa Department of Transportation Office of Contracts Letting Summary - Fiscal 2008

Report of the letting activity of the Iowa Department of Transportation's Office of Contracts required by Iowa Code Section 307.12(15).

Iowa Department of Transportation Fiscal Year 2008 Report of Savings by Using Video Conferencing Through Iowa Communications Network to the Iowa General Assembly Pursuant to Iowa Code § II 84 Acts and Joint Resolutions Enacted at the 1994 Regular Session of the 75th General Assembly of the State of Iowa Iowa Code §8D.10 Report of Savings by State Agencies

Iowa Code § 8D.10 requires certain state agencies prepare an annual report to the General Assembly certifying the identified savings associated with that state agency’s use of the Iowa Communications Network (ICN). This report covers estimated cost savings related to video conferencing via ICN for the Iowa Department of Transportation (DOT). In FY 2008, the DOT did not conduct any sessions utilizing ICN’s video conferencing system. Therefore, no cost savings were calculated for this report.