<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Elizabeth Maggie Penn</style></author><author><style face="normal" font="default" size="100%">John W. Patty</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Amendments, Covering and Agenda Control: The Politics of Open Rules</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we define a binary relation for general collective choice situations, the needing relation, that captures one notion of dependence between alternatives with respect to inclusion in several popular solution concepts, including the top-cycle set, the uncovered set, the Banks set, and the minimal covering set. After defining the relation and relating it to a graph theoretical view of collective preference, we prove several results about the relation and provide a partial characterization of external stability of some tournament solution concepts. We then utilize the needing relation to define a property of tournament solution concepts,
which we dub independence. Finally, the independence of several solution concepts is characterized.</style></abstract></record></records></xml>