Остановите войну!
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 36 matches
- 2008
- Klaus Abbink, Jordi Brandts:
24. Pricing in Bertrand competition with increasing marginal costs. Games Econ. Behav. 63(1): 1-31 (2008) - Yaron Azrieli, Ehud Lehrer:
The value of a stochastic information structure. Games Econ. Behav. 63(2): 679-693 (2008) - Moshe Babaioff, Liad Blumrosen:
Computationally-feasible truthful auctions for convex bundles. Games Econ. Behav. 63(2): 588-620 (2008) - Dirk Bergemann, Stephen Morris:
Ex post implementation. Games Econ. Behav. 63(2): 527-566 (2008) - Christopher P. Chambers:
Proper scoring rules for general decision models. Games Econ. Behav. 63(1): 32-40 (2008) - Chih Chang, Cheng-Cheng Hu:
A non-cooperative interpretation of the f-just rules of bankruptcy problems. Games Econ. Behav. 63(1): 133-144 (2008) - Vincent Conitzer, Tuomas Sandholm:
New complexity results about Nash equilibria. Games Econ. Behav. 63(2): 621-641 (2008) - Tarek Coury, Vladimir P. Petkov:
Delegation and commitment in durable goods monopolies. Games Econ. Behav. 63(1): 41-55 (2008) - David Dickinson, Marie-Claire Villeval:
Does monitoring decrease work effort?: The complementarity between agency and crowding-out theories. Games Econ. Behav. 63(1): 56-76 (2008) - Jeffrey C. Ely, Drew Fudenberg, David K. Levine:
When is reputation bad? Games Econ. Behav. 63(2): 498-526 (2008) - Michael A. Fishman:
Asymmetric evolutionary games with non-linear pure strategy payoffs. Games Econ. Behav. 63(1): 77-90 (2008) - Thomas Giebe, Elmar Wolfstetter:
License auctions with royalty contracts for (winners and) losers. Games Econ. Behav. 63(1): 91-106 (2008) - David Gill, Daniel Sgroi:
Sequential decisions with tests. Games Econ. Behav. 63(2): 663-678 (2008) - Ani Guerdjikova:
Case-based learning with different similarity functions. Games Econ. Behav. 63(1): 107-132 (2008) - Kris De Jaegher:
Efficient communication in the electronic mail game. Games Econ. Behav. 63(2): 468-497 (2008) - Jens Josephson, Karl Wärneryd:
Long-run selection and the work ethic. Games Econ. Behav. 63(1): 354-365 (2008) - Ehud Kalai:
Presidential address. Games Econ. Behav. 63(2): 421-430 (2008) - René Kirkegaard, Per Baltzer Overgaard:
Pre-auction offers in asymmetric first-price and second-price auctions. Games Econ. Behav. 63(1): 145-165 (2008) - Annick Laruelle, Federico Valenciano:
Noncooperative foundations of bargaining power in committees and the Shapley-Shubik index. Games Econ. Behav. 63(1): 341-353 (2008) - Eliot Maenner:
Adaptation and complexity in repeated games. Games Econ. Behav. 63(1): 166-187 (2008) - Shie Mannor, Nahum Shimkin:
Regret minimization in repeated matrix games with variable stage duration. Games Econ. Behav. 63(1): 227-258 (2008) - Alan D. Miller:
Group identification. Games Econ. Behav. 63(1): 188-202 (2008) - Hervé Moulin:
Proportional scheduling, split-proofness, and merge-proofness. Games Econ. Behav. 63(2): 567-587 (2008) - Christina Pawlowitsch:
Why evolution does not always lead to an optimal signaling system. Games Econ. Behav. 63(1): 203-226 (2008) - Ryan Porter, Eugene Nudelman, Yoav Shoham:
Simple search methods for finding a Nash equilibrium. Games Econ. Behav. 63(2): 642-662 (2008) - Philip J. Reny:
2004 World Congress Special Issue. Games Econ. Behav. 63(2): 431-434 (2008) - William H. Sandholm:
H. Peyton Young, , Strategic Learning and Its Limits (2004) Oxford Univ. Press 165 pages. Games Econ. Behav. 63(1): 417-420 (2008) - Mark Satterthwaite, Artyom Shneyerov:
Convergence to perfect competition of a dynamic matching and bargaining market with two-sided incomplete information and exogenous exit rate. Games Econ. Behav. 63(2): 435-467 (2008) - Colin Sparrow, Sebastian van Strien, Christopher J. Harris:
Fictitious play in 3×3 games: The transition between periodic and chaotic behaviour. Games Econ. Behav. 63(1): 259-291 (2008) - Dale O. Stahl, Ernan Haruvy:
Subgame perfection in ultimatum bargaining trees. Games Econ. Behav. 63(1): 292-307 (2008)
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-05-05 12:35 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