![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 2023
- Grigory I. Belyavsky, N. V. Danilova, Guennady A. Ougolnitsky:
A Model to Coordinate Interests in Investment Management. IGTR 25(1): 2350002:1-2350002:12 (2023) - Monika Bisht
, Rajesh Dangwal:
Fuzzy Ranking Approach to Bi-Matrix Games with Interval Payoffs in Marketing-Management Problem. IGTR 25(1): 2250016:1-2250016:20 (2023) - Walter Briec, Audrey Dumas, Jeremie Mauranyapin:
Generalized Means and Randomization Scheme of Nash Equilibria. IGTR 25(4): 2350009:1-2350009:41 (2023) - Pranjal Chandrakar, Manaswini Bhalla, Shubhabrata Das:
Sequential Auctions with Multiple Synergies. IGTR 25(1): 2350001:1-2350001:39 (2023) - Jeanpantz Chen:
Theory of Cooperative Public Choice Games. IGTR 25(2): 2350008:1-2350008:27 (2023) - Indrani Roy Chowdhury:
Centralized versus Decentralized Control of Forest Use in a Federal Structure with Elite Capture. IGTR 25(3): 2340003:1-2340003:15 (2023) - Dipti Dubey, S. K. Neogy, T. E. S. Raghavan:
A Note on Linear Complementarity via Two-Person Zero-Sum Games. IGTR 25(1): 2250019:1-2250019:8 (2023) - A. Dutta, A. K. Das:
Homotopy Continuation Method for Discounted Zero-Sum Stochastic Game with ARAT Structure. IGTR 25(3): 2340004:1-2340004:18 (2023) - Andrey Garnaev, Wade Trappe:
A Bandwidth Scanning Game with a Sophisticated Adversary. IGTR 25(3): 2340002:1-2340002:16 (2023) - Masahiro Hachimori, Yumi Yamada:
Some Computational Study of the Root Distribution of Ehrhart Polynomials. IGTR 25(3): 2340005:1-2340005:15 (2023) - Joseph L. Heyman, Abhishek Gupta:
Rank Reduction in Bimatrix Games. IGTR 25(1): 2250017:1-2250017:29 (2023) - Reinoud Joosten, Rogier Harmelink:
Tipping and strong rarity value in a stochastic fishery game. IGTR 25(3): 2340001:1-2340001:34 (2023) - Nathalie Jorzik:
Axiomatization and Core Stability of Allocation Rules for Hypergraph Situations. IGTR 25(2): 2350007:1-2350007:17 (2023) - Alexey V. Korolev, Guennady A. Ougolnitsky:
Cooperative Game-Theoretic Models of the Cournot Oligopoly. IGTR 25(2): 2350004:1-2350004:31 (2023) - Shoude Li:
A Differential Game Analysis of the Firms' Process Innovation with Technological Spillover Under Different Market Structures in a Duopoly Market. IGTR 25(4): 2250012:1-2250012:22 (2023) - Divya Murali, A. J. Shaiju:
Best-Response Dynamics for Evolutionary Stochastic Games. IGTR 25(4): 2350010:1-2350010:31 (2023) - Aradhana Narang
, A. J. Shaiju
:
Robustness Against Indirect Invasions in Asymmetric Games with Continuous Strategy Spaces. IGTR 25(4): 2350012:1-2350012:16 (2023) - Florian Navarro
:
Associated Consistency and the Aumann-Drèze Value. IGTR 25(1): 2250018:1-2250018:18 (2023) - Ronit Neogy:
On Some Special Matrix Classes Useful in Optimization and Game Theory. IGTR 25(3): 2340006:1-2340006:11 (2023) - S. K. Neogy, R. B. Bapat, T. Parthasarathy:
Preface - Special Issue on Computational Operations Research and Algorithmic Game Theory. IGTR 25(3): 2302001:1-2302001:3 (2023) - Ko Nishihara
:
Resolution of the n-person Prisoners' Dilemma by Kalai's Preplay Negotiation Procedure. IGTR 25(4): 2350013:1-2350013:21 (2023) - Elena M. Parilina, Alessandro Tampieri:
Faking Patience with Tacit Collusion. IGTR 25(2): 2350003:1-2350003:34 (2023) - Thiruvankatachari Parthasarathy, Gomatam Ravindran, A. R. Sricharan:
Completely Mixed Discounted Bistochastic Games. IGTR 25(3): 2340007:1-2340007:18 (2023) - K. A. Shchelchkov:
One-Sided Capture in Nonlinear Differential Games. IGTR 25(2): 2350006:1-2350006:14 (2023) - Stefano Vannucci:
Revealed VNM-Solutions: Characterizations. IGTR 25(4): 2350011:1-2350011:24 (2023) - Elena Yanovskaya:
Rich Extensions of the Core and the Equal Split Off Set. IGTR 25(2): 2350005:1-2350005:20 (2023)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-09-11 19:19 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