Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Hans Reijnierse
aka: J. H. Reijnierse, Johannes H. Reijnierse
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 24 matches
- 2018
- 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) - Mirjam Groote Schaarsberg, Hans Reijnierse, Peter Borm:
On solving mutual liability problems. Math. Methods Oper. Res. 87(3): 383-409 (2018) - 2016
- John Kleppe, Hans Reijnierse, Peter Sudhölter:
Axiomatizations of symmetrically weighted solutions. Ann. Oper. Res. 243(1-2): 37-53 (2016) - 2015
- 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
- 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
- Hans Reijnierse, Peter Borm, Marieke Quant, Marc Meertens:
Processing games with restricted capacities. Eur. J. Oper. Res. 202(3): 773-780 (2010) - 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) - John Kleppe, Marieke Quant, Hans Reijnierse:
Public congestion network situations and related games. Networks 55(4): 368-378 (2010) - 2009
- 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
- Marieke Quant, Marc Meertens, Hans Reijnierse:
Processing games with shared interest. Ann. Oper. Res. 158(1): 219-228 (2008) - 2007
- Marc Meertens, Jos A. M. Potters, J. H. Reijnierse:
On Bargaining Sets in Symmetric Games. IGTR 9(2): 199-213 (2007) - 2006
- Marieke Quant, Peter Borm, Hans Reijnierse:
Congestion network problems and related games. Eur. J. Oper. Res. 172(3): 919-930 (2006) - Jos A. M. Potters, Hans Reijnierse, Amit Biswas:
The nucleolus of balanced simple flow networks. Games Econ. Behav. 54(1): 205-225 (2006) - Marc Meertens, Jos A. M. Potters, Hans Reijnierse:
Dynamic Selection in Normal-Form Games. IGTR 8(3): 395-416 (2006) - 2005
- 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) - 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
- 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) - 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
- 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
- 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
- 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
- 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) - J. H. Reijnierse, Jos A. M. Potters:
On finding an envy-free Pareto-optimal division. Math. Program. 83: 291-311 (1998) - 1996
- 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)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-08-10 16:23 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint