Остановите войну!
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
no matches
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 40 matches
- 1998
- Hans-Peter Battenberg, Bernd-Jürgen Falkowski:
On saddlepoints of two-person zero-sum games with applications to data verification tests. Int. J. Game Theory 27(4): 561-576 (1998) - Jesús Mario Bilbao:
Values and potential of games with cooperation structure. Int. J. Game Theory 27(1): 131-145 (1998) - Gary E. Bolton, Elena Katok, Rami Zwick:
Dictator game giving: Rules of fairness versus acts of kindness. Int. J. Game Theory 27(2): 269-299 (1998) - José Canals, Fernando Vega-Redondo:
Multi-level evolution in population games. Int. J. Game Theory 27(1): 21-35 (1998) - Ani Dasgupta, Y. Stephen Chiu:
On implementation via demand commitment games. Int. J. Game Theory 27(2): 161-189 (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) - Theo S. H. Driessen:
A note on the inclusion of the kernel in the core of the bilateral assignment game. Int. J. Game Theory 27(2): 301-303 (1998) - Bhaskar Dutta, Anne van den Nouweland, Stef Tijs:
Link formation in cooperative situations. Int. J. Game Theory 27(2): 245-256 (1998) - Christian Ewerhart:
Rationality and the definition of consistent pairs. Int. J. Game Theory 27(1): 49-59 (1998) - Ulrich Faigle, Walter Kern, Jeroen Kuipers:
Note Computing the nucleolus of min-cost spanning tree games is NP-hard - Computing the nucleolus of min-cost spanning tree games is NP-hard. Int. J. Game Theory 27(3): 443-450 (1998) - Daniel Granot, Frieda Granot, Weiping R. Zhu:
Characterization sets for the nucleolus. Int. J. Game Theory 27(3): 359-374 (1998) - Daniel Granot, Michael Maschler:
Spanning network games. Int. J. Game Theory 27(4): 467-500 (1998) - David Housman, Lori Clark:
Note Core and monotonic allocation methods - Core and monotonic allocation methods. Int. J. Game Theory 27(4): 611-616 (1998) - Ulrich Kamecke:
Dominance or maximin: How to solve an English auction. Int. J. Game Theory 27(3): 407-426 (1998) - Yakar Kannai, Emmanuel Tannenbaum:
Paths leading to the Nash set for nonsmooth games. Int. J. Game Theory 27(3): 393-405 (1998) - Klaus Kultti, Hannu Salonen:
Iterated dominance in quasisupermodular games with strict single crossing property. Int. J. Game Theory 27(2): 305-309 (1998) - Ehud Lehrer, Sylvain Sorin:
ɛ-Consistent equilibrium in repeated games. Int. J. Game Theory 27(2): 231-244 (1998) - Ashok P. Maitra, William D. Sudderth:
Finitely additive stochastic games with Borel measurable payoffs. Int. J. Game Theory 27(2): 257-267 (1998) - Richard P. McLean, William W. Sharkey:
Weighted Aumann-Shapley pricing. Int. J. Game Theory 27(4): 511-523 (1998) - Ana Meca-Martínez, Joaquín Sánchez-Soriano, Ignacio García-Jurado, Stef Tijs:
Strong equilibria in claim games corresponding to convex games. Int. J. Game Theory 27(2): 211-217 (1998) - Luciano Méndez-Naya:
Weak topology and infinite matrix games. Int. J. Game Theory 27(2): 219-229 (1998) - Jean-François Mertens:
The speed of convergence in repeated games with incomplete information on one side. Int. J. Game Theory 27(3): 343-357 (1998) - Igal Milchtaich:
Crowding games are sequentially solvable. Int. J. Game Theory 27(4): 501-509 (1998) - Mitsunobu Miyake:
On the incentive properties of multi-item auctions. Int. J. Game Theory 27(1): 1-19 (1998) - Roger B. Myerson:
Population uncertainty and Poisson games. Int. J. Game Theory 27(3): 375-392 (1998) - Abraham Neyman, Sylvain Sorin:
Equilibria in repeated games of incomplete information: The general symmetric case. Int. J. Game Theory 27(2): 201-210 (1998) - Wojciech Olszewski:
Perfect folk theorems. Does public randomization matter? Int. J. Game Theory 27(1): 147-156 (1998) - Gert-Jan Otten, Peter Borm, Bezalel Peleg, Stef Tijs:
The MC-value for monotonic NTU-games. Int. J. Game Theory 27(1): 37-47 (1998) - Mário R. Páscoa:
Nash equilibrium and the law of large numbers. Int. J. Game Theory 27(1): 83-92 (1998) - Fioravante Patrone, Graziano Pieri, Stef Tijs, Anna Torre:
On consistent solutions for strategic games. Int. J. Game Theory 27(2): 191-200 (1998)
skipping 10 more matches
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-05-05 23:28 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