Multi-sided assignment games on m-partite graphs was presented by Ata ATAY at the Aix-Marseille School of Economics seminar.
We consider a multi-sided assignment game with the following characteristics: (a) the agents are organized in m sectors that are connected by a graph that induces a weighted m-partite graph on the set of agents, (b) a basic coalition is formed by agents from different connected sectors, and (c) the worth of a basic coalition is the addition of the weights of all its pairs that belong to connected sectors. We provide a sufficient condition on the weights to guarantee balancedness of the related multi-sided assignment game. Moreover, when the graph on the sectors is cycle-free, we prove the game is strongly balanced and the core is fully described by means of the cores of the underlying two-sided assignment games associated with the edges of this graph. As a consequence, the complexity of the computation of an optimal matching is reduced and existence of optimal core allocations for each sector of the market is guaranteed.
Venue: MTA HTK 1097 Budapest Tóth Kálmán u. 4. fszt. K013-14-es előadóterem Ride-share matching algorithms generate income inequality Eszter Bokányi and Anikó Hannák Abstract Despite the potential of online sharing economy platforms such as Uber, Lyft, ... Details »
Venue: MTA HTK 1097 Budapest Tóth Kálmán u. 4. fszt. K011-12-es előadóterem Kiss Hubert János: Coopetition in group contest https://www.mtakti.hu/wp-content/uploads/2019/05/MTDP1911.pdf Share this:FacebookLinkedInTwitter
“Opinion leaders – experts of social relations” was presented by Balázs SZIKLAI at the EURO2019 – 30th European Conference on Operational Research. Share this:FacebookLinkedInTwitter
Download “Coopetition in group contest” by Hubert János Kiss – Alfonso Rosa-Garcia – Vita Zhukova here. Abstract There are situations in which competitors ally ... Details »
Ata Atay‘s two recent workings papers have been published and are accessible at the following links: A bargaining set for roommate ... Details »