{"language":[{"iso":"eng"}],"_id":"474","file":[{"file_id":"1329","file_name":"474-WP73.pdf","content_type":"application/pdf","date_updated":"2018-03-16T11:16:59Z","creator":"florida","relation":"main_file","access_level":"closed","file_size":424301,"date_created":"2018-03-16T11:16:59Z","success":1}],"citation":{"ieee":"N. Röhl, Two-Stage Allocation Procedures. Universität Paderborn, 2013.","bibtex":"@book{Röhl_2013, title={Two-Stage Allocation Procedures}, publisher={Universität Paderborn}, author={Röhl, Nils}, year={2013} }","apa":"Röhl, N. (2013). Two-Stage Allocation Procedures. Universität Paderborn.","mla":"Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn, 2013.","chicago":"Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn, 2013.","ama":"Röhl N. Two-Stage Allocation Procedures. Universität Paderborn; 2013.","short":"N. Röhl, Two-Stage Allocation Procedures, Universität Paderborn, 2013."},"author":[{"last_name":"Röhl","full_name":"Röhl, Nils","first_name":"Nils"}],"year":"2013","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T07:01:20Z","department":[{"_id":"205"}],"title":"Two-Stage Allocation Procedures","has_accepted_license":"1","user_id":"477","date_created":"2017-10-17T12:42:24Z","abstract":[{"lang":"eng","text":"Suppose some individuals are allowed to engage in different groups at the same time and they generate a certain welfare by cooperation. Finding appropriate ways for distributing this welfare is a non-trivial issue. The purpose of this work is to analyze two-stage allocation procedures where first each group receives a share of the welfare which is then, subsequently, distributed among the corresponding members. To study these procedures in a structured way, cooperative games and network games are combined in a general framework by using mathematical hypergraphs. Moreover, several convincing requirements on allocation procedures are discussed and formalized. Thereby it will be shown, for example, that the Position Value and iteratively applying the Myerson Value can be characterized by similar axiomatizations."}],"ddc":["040"],"status":"public","type":"report","file_date_updated":"2018-03-16T11:16:59Z","publisher":"Universität Paderborn"}