@inbook {17594,
	title = {Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry},
	booktitle = {Algorithm EngineeringAlgorithm Engineering},
	series = {Lecture Notes in Computer Science},
	volume = {2141},
	year = {2001},
	month = {2001///},
	pages = {172 - 184},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {We consider the bilateral contract satisfaction problem arising from electrical power networks due to the proposed deregulation of the electric utility industry in the USA. Given a network and a (multi)set of pairs of vertices (contracts) with associated demands, the goal is to find the maximum number of simultaneously satisfiable contracts. We study how four different algorithms perform in fairly realistic settings; we use an approximate electrical power network from Colorado. Our experiments show that three heuristics outperform a theoretically better algorithm. We also test the algorithms on four types of scenarios that are likely to occur in a deregulated marketplace. Our results show that the networks that are adequate in a regulated marketplace might be inadequate for satisfying all the bilateral contracts in a deregulated industry.},
	isbn = {978-3-540-42500-7},
	url = {http://dx.doi.org/10.1007/3-540-44688-5_14},
	author = {Barrett,Chris and Cook,Doug and Hicks,Gregory and Faber,Vance and Marathe,Achla and Marathe,Madhav and Srinivasan, Aravind and Sussmann,Yoram and Thornquist,Heidi},
	editor = {Brodal,Gerth and Frigioni,Daniele and Marchetti-Spaccamela,Alberto}
}
