default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHans Reijnierse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j24]John Kleppe, Peter Borm
, Ruud Hendrickx, Hans Reijnierse:
On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations. IGTR 20(4): 1850007:1-1850007:28 (2018)- [j23]Mirjam Groote Schaarsberg, Hans Reijnierse, Peter Borm:
On solving mutual liability problems. Math. Methods Oper. Res. 87(3): 383-409 (2018) - 2016
- [j22]John Kleppe, Hans Reijnierse, Peter Sudhölter:
Axiomatizations of symmetrically weighted solutions. Ann. Oper. Res. 243(1-2): 37-53 (2016) - 2015
- [j21]Sybren Huijink, Peter E. M. Borm, John Kleppe, J. H. Reijnierse:
Bankruptcy and the per capita nucleolus: The claim-and-right rules family. Math. Soc. Sci. 77: 15-31 (2015) - 2014
- [j20]Arantza Estévez-Fernández, Hans Reijnierse:
On the core of cost-revenue games: Minimum cost spanning tree games with revenues. Eur. J. Oper. Res. 237(2): 606-616 (2014) - 2010
- [j19]Hans Reijnierse, Peter Borm, Marieke Quant, Marc Meertens:
Processing games with restricted capacities. Eur. J. Oper. Res. 202(3): 773-780 (2010) - [j18]Michael Maschler, Jos A. M. Potters, Hans Reijnierse:
The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties. Int. J. Game Theory 39(1-2): 89-104 (2010) - [j17]John Kleppe, Marieke Quant, Hans Reijnierse:
Public congestion network situations and related games. Networks 55(4): 368-378 (2010) - 2009
- [j16]Arantza Estévez-Fernández, Peter Borm, Marc Meertens, Hans Reijnierse:
On the core of routing games with revenues. Int. J. Game Theory 38(2): 291-304 (2009) - 2008
- [j15]Marieke Quant, Marc Meertens, Hans Reijnierse:
Processing games with shared interest. Ann. Oper. Res. 158(1): 219-228 (2008) - 2007
- [j14]Marc Meertens, Jos A. M. Potters, J. H. Reijnierse:
On Bargaining Sets in Symmetric Games. IGTR 9(2): 199-213 (2007) - 2006
- [j13]Marieke Quant, Peter Borm, Hans Reijnierse:
Congestion network problems and related games. Eur. J. Oper. Res. 172(3): 919-930 (2006) - [j12]Jos A. M. Potters, Hans Reijnierse, Amit Biswas:
The nucleolus of balanced simple flow networks. Games Econ. Behav. 54(1): 205-225 (2006) - [j11]Marc Meertens, Jos A. M. Potters, Hans Reijnierse:
Dynamic Selection in Normal-Form Games. IGTR 8(3): 395-416 (2006) - 2005
- [j10]Marc Meertens, Jos A. M. Potters, J. H. Reijnierse:
Bargaining sets in exchange economies with indivisibilities and money. Int. J. Game Theory 33(2): 271-285 (2005) - [j9]Marieke Quant, Peter Borm, Hans Reijnierse, Bas van Velzen:
The core cover in relation to the nucleolus and the Weber set. Int. J. Game Theory 33(4): 491-503 (2005) - 2002
- [j8]Henk Norde, Hans Reijnierse:
A dual description of the class of games with a population monotonic allocation scheme. Games Econ. Behav. 41(2): 322-343 (2002) - [j7]Marc Meertens, Jos A. M. Potters, Hans Reijnierse:
Envy-free and Pareto efficient allocations in economies with indivisible goods and money. Math. Soc. Sci. 44(3): 223-233 (2002) - 2001
- [j6]Martin Dufwenberg, Henk Norde, Hans Reijnierse, Stef Tijs:
The consistency principle for set-valued solutions and a new direction for normative game theory. Math. Methods Oper. Res. 54(1): 119-131 (2001) - 2000
- [j5]J. R. G. van Gellekom, Jos A. M. Potters, J. H. Reijnierse, M. C. Engel, Stef Tijs:
Characterization of the Owen Set of Linear Production Processes. Games Econ. Behav. 32(1): 139-156 (2000) - 1999
- [j4]J. R. G. van Gellekom, Jos A. M. Potters, J. H. Reijnierse:
Prosperity properties of TU-games. Int. J. Game Theory 28(2): 211-227 (1999) - 1998
- [j3]Jean Derks, Hans Reijnierse:
Note On the core of a collection of coalitions - On the core of a collection of coalitions. Int. J. Game Theory 27(3): 451-459 (1998) - [j2]J. H. Reijnierse, Jos A. M. Potters:
On finding an envy-free Pareto-optimal division. Math. Program. 83: 291-311 (1998) - 1996
- [j1]Jos A. M. Potters, Johannes H. Reijnierse, Michel Ansing:
Computing the Nucleolus by Solving a Prolonged Simplex Algorithm. Math. Oper. Res. 21(3): 757-768 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
