Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Hans Reijnierse"'
Publikováno v:
International Game Theory Review, 20:1850007. World Scientific Publishing Co. Pte Ltd
To analyze cost allocation problems, this paper identifies associated cooperation building structures, with joint cost functions, and corresponding efficient order problem representations, with individualized cost functions. This paper presents an ap
Publikováno v:
Estevez Fernandez, M A & Reijnierse, H 2014, ' On the core of cost-revenue games: Minimum cost spanning tree games with revenues ', European Journal of Operational Research, vol. 237, no. 2, pp. 606-616 . https://doi.org/10.1016/j.ejor.2014.01.056
European Journal of Operational Research, 237(2), 606-616. Elsevier
European Journal of Operational Research, 237(2), 606-616. Elsevier Science BV
European Journal of Operational Research, 237(2), 606-616. Elsevier
European Journal of Operational Research, 237(2), 606-616. Elsevier Science BV
This discussion paper led to an article in 'European Journal of Operational Research' , (2014), 237, 606-616. In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To
Publikováno v:
Annals of Operations Research, 243(1), 37-53. Springer
Kleppe, J, Reijnierse, H & Sudhölter, P 2013, ' Axiomatizations of symmetrically weighted solutions ', CentER Discussion Paper Series, vol. 2013-007 . https://doi.org/10.2139/ssrn.2211444
Kleppe, J, Reijnierse, H & Sudhölter, P 2016, ' Axiomatizations of symmetrically weighted solutions ', Annals of Operations Research, vol. 243, no. 1-2, pp. 37-53 . https://doi.org/10.1007/s10479-013-1494-1
Kleppe, J, Reijnierse, H & Sudhölter, P 2013, ' Axiomatizations of symmetrically weighted solutions ', CentER Discussion Paper Series, vol. 2013-007 . https://doi.org/10.2139/ssrn.2211444
Kleppe, J, Reijnierse, H & Sudhölter, P 2016, ' Axiomatizations of symmetrically weighted solutions ', Annals of Operations Research, vol. 243, no. 1-2, pp. 37-53 . https://doi.org/10.1007/s10479-013-1494-1
If the excesses of the coalitions in a transferable utility game are weighted, then we show that the arising weighted modifications of the well-known (pre)nucleolus and (pre)kernel satisfy the equal treatment property if and only if the weight system
Publikováno v:
Naval Research Logistics (NRL). 60:607-624
This article introduces maximum cooperative purchasing (MCP)-situations, a new class of cooperative purchasing situations. Next, an explicit alternative mathematical characterization of the nucleolus of cooperative games is provided. The allocation o
Publikováno v:
Mathematical Methods of Operations Research, 87(3), 383-409. SPRINGER HEIDELBERG
Mathematical Methods of Operations Research (Heidelberg, Germany)
Mathematical Methods of Operations Research, 1-27
Mathematical Methods of Operations Research (Heidelberg, Germany)
Mathematical Methods of Operations Research, 1-27
This paper introduces mutual liability problems, as a generalization of bankruptcy problems, where every agent not only owns a certain amount of cash money, but also has outstanding claims and debts towards the other agents. Assuming that the agents
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::76c28f2da62df767d604eea1a57052e1
http://resolver.tudelft.nl/uuid:bc59a8c8-17d9-4878-88fb-f36b888d853a
http://resolver.tudelft.nl/uuid:bc59a8c8-17d9-4878-88fb-f36b888d853a
Publikováno v:
International Journal of Game Theory. 39:89-104
This paper introduces yet another algorithm to compute the nucleolus of a standard tree game. One advantage of this algorithm is that it provides a very intuitive interpretation of the nucleolus, under which the players participate in a joint enterpr
Autor:
Hans Reijnierse, John Kleppe
Publikováno v:
Networks, 55(4), 368-378. Wiley-Liss Inc.
Tilburg University-PURE
Tilburg University-PURE
This paper analyzes congestion effects on network situations from a cooperative game theoretic perspective. In network situations players have to connect themselves to a source. Since we consider publicly available networks any group of players is al
Publikováno v:
Annals of Operations Research, 158(1), 219-228. Springer
Tilburg University-PURE
Tilburg University-PURE
This paper introduces processing problems with shared interest as an extension of processing situations with restricted capacities (Meertens, M., et al., Processing games with restricted capacities, 2004). Next to an individual capacity to handle job
Publikováno v:
International Game Theory Review. :395-416
This paper investigates a class of dynamic selection processes for n-person normal-form games which includes the Brown-von Neumann-Nash dynamics. For (two-person) zero-sum games and for (n-person) potential games every limit set of these dynamics is