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 36 matches
- 2008
- Georgy Artemov:
Matching and price competition: would personalized prices help? Int. J. Game Theory 36(3-4): 321-331 (2008) - Péter Biró, Katarína Cechlárová, Tamás Fleiner:
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems. Int. J. Game Theory 36(3-4): 333-352 (2008) - Steven J. Brams, Michael A. Jones, Christian Klamler:
Proportional pie-cutting. Int. J. Game Theory 36(3-4): 353-367 (2008) - David Cantala, Francisco Sánchez-Sánchez:
Welfare and stability in senior matching markets. Int. J. Game Theory 36(3-4): 369-392 (2008) - Robert Day, Paul Milgrom:
Core-selecting package auctions. Int. J. Game Theory 36(3-4): 393-407 (2008) - Kimmo Eriksson, Olle Häggström:
Instability of matchings in decentralized markets with various preference structures. Int. J. Game Theory 36(3-4): 409-420 (2008) - Kimmo Eriksson, Jonas Sjöstrand, Pontus Strimling:
Asymmetric equilibria in dynamic two-sided matching markets with independent preferences. Int. J. Game Theory 36(3-4): 421-440 (2008) - Sergiu Hart:
Discrete Colonel Blotto and General Lotto games. Int. J. Game Theory 36(3-4): 441-460 (2008) - Elena Inarra, Concepción Larrea, Elena Molis:
Random paths to P -stability in the roommate problem. Int. J. Game Theory 36(3-4): 461-471 (2008) - Fuhito Kojima, M. Utku Ünver:
Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration. Int. J. Game Theory 36(3-4): 473-488 (2008) - Mihai Manea:
Random serial dictatorship and ordinally efficient contracts. Int. J. Game Theory 36(3-4): 489-496 (2008) - Ruth Martínez, Jordi Massó, Alejandro Neme, Jorge Oviedo:
On the invariance of the set of stable matchings with respect to substitutable preference profiles. Int. J. Game Theory 36(3-4): 497-518 (2008) - Nitsan Perach, Julia Polak, Uriel G. Rothblum:
A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the technion. Int. J. Game Theory 36(3-4): 519-535 (2008) - Alvin E. Roth:
Deferred acceptance algorithms: history, theory, practice, and open questions. Int. J. Game Theory 36(3-4): 537-569 (2008) - Uzi Segal, Joel Sobel:
A characterization of intrinsic reciprocity. Int. J. Game Theory 36(3-4): 571-585 (2008) - Konstantinos Serfes:
Endogenous matching in a market with heterogeneous principals and agents. Int. J. Game Theory 36(3-4): 587-619 (2008) - Marilda Sotomayor:
A collection of papers dedicated to David Gale on the occasion of his 85th birthday. Int. J. Game Theory 36(3-4): 317-319 (2008) - Marilda Sotomayor:
The stability of the equilibrium outcomes in the admission games induced by stable matching rules. Int. J. Game Theory 36(3-4): 621-640 (2008) - 2007
- Zafer Akin:
Time inconsistency and learning in bargaining games. Int. J. Game Theory 36(2): 275-299 (2007) - Yaron Azrieli, Ehud Lehrer:
On some families of cooperative fuzzy games. Int. J. Game Theory 36(1): 1-15 (2007) - Gustavo Bergantiños, Juan J. Vidal-Puga:
The optimistic TU game in minimum cost spanning tree problems. Int. J. Game Theory 36(2): 223-239 (2007) - Jesús Mario Bilbao, Julio Rodrigo Fernández García, N. Jiménez, J. J. López:
The core and the Weber set for bicooperative games. Int. J. Game Theory 36(2): 209-222 (2007) - Olivier Bochet:
Implementation of the Walrasian correspondence: the boundary problem. Int. J. Game Theory 36(2): 301-316 (2007) - Edward J. Cartwright:
Imitation, coordination and the emergence of Nash equilibrium. Int. J. Game Theory 36(1): 119-135 (2007) - André Casajus:
The position value is the Myerson value, in a sense. Int. J. Game Theory 36(1): 47-55 (2007) - Youngsub Chun, Junghoon Lee:
On the convergence of the random arrival rule in large claims problems. Int. J. Game Theory 36(2): 259-273 (2007) - Victor K. Domansky:
Repeated games with asymmetric information and random price fluctuations at finance markets. Int. J. Game Theory 36(2): 241-257 (2007) - Arantza Estévez-Fernández, Peter Borm, Herbert Hamers:
Project games. Int. J. Game Theory 36(2): 149-176 (2007) - Julio González-Díaz, Estela Sánchez-Rodríguez:
A natural selection from the core of a TU game: the core-center. Int. J. Game Theory 36(1): 27-46 (2007) - Kevin Hasker:
Social norms and choice: a weak folk theorem for repeated matching games. Int. J. Game Theory 36(1): 137-146 (2007)
skipping 6 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-11-09 03:37 CET 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