Остановите войну!
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 26 matches
- 2019
- Eleni C. Akrida, Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis:
Connected Subgraph Defense Games. SAGT 2019: 216-236 - Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching on Uniformly Sparse Graphs. SAGT 2019: 357-373 - Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen:
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. SAGT 2019: 153-167 - Vittorio Bilò, Laurent Gourvès, Jérôme Monnot:
On a Simple Hedonic Game with Graph-Restricted Communication. SAGT 2019: 252-265 - Avrim Blum, Nika Haghtalab, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Computing Stackelberg Equilibria of Large General-Sum Games. SAGT 2019: 168-182 - Simina Brânzei, Claudio Orlandi, Guang Yang:
Sharing Information with Competitors. SAGT 2019: 34-48 - Ioannis Caragiannis, George Christodoulou, Nicos Protopapas:
Impartial Selection with Additive Approximation Guarantees. SAGT 2019: 269-283 - Markos Epitropou, Rakesh Vohra:
Optimal On-Line Allocation Rules with Verification. SAGT 2019: 3-17 - Bruno Escoffier, Hugo Gilbert, Adèle Pass-Lanneau:
The Convergence of Iterative Delegations in Liquid Democracy in a Social Network. SAGT 2019: 284-297 - Diodato Ferraioli, Carmine Ventre:
Obvious Strategyproofness, Bounded Rationality and Approximation - The Case of Machine Scheduling. SAGT 2019: 77-91 - Aris Filos-Ratsikas, Evi Micha, Alexandros A. Voudouris:
The Distortion of Distributed Voting. SAGT 2019: 312-325 - Joseph Y. Halpern, Rafael Pass, Daniel Reichman:
On the Existence of Nash Equilibrium in Games with Resource-Bounded Players. SAGT 2019: 139-152 - Daniel Halpern, Nisarg Shah:
Fair Division with Subsidy. SAGT 2019: 374-389 - Seunghee Han, Matvey Soloviev, Yuwen Wang:
The Impact of Tribalism on Social Welfare. SAGT 2019: 185-199 - Max Klimm, Daniel Schmand, Andreas Tönnis:
The Online Best Reply Algorithm for Resource Allocation Problems. SAGT 2019: 200-215 - Maria Kyropoulou, Carmine Ventre, Xiaomeng Zhang:
Mechanism Design for Constrained Heterogeneous Facility Location. SAGT 2019: 63-76 - Chi-Kit Lam, C. Gregory Plaxton:
On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences. SAGT 2019: 329-342 - Chi-Kit Lam, C. Gregory Plaxton:
Maximum Stable Matching with One-Sided Ties of Bounded Length. SAGT 2019: 343-356 - Siqi Liu, J. Benjamin Miller, Alexandros Psomas:
Risk Robust Mechanism Design for a Prospect Theoretic Buyer. SAGT 2019: 95-108 - Reshef Meir:
Strategyproof Facility Location for Three Agents on a Circle. SAGT 2019: 18-33 - Vijay Menon, Kate Larson:
Mechanism Design for Locating a Facility Under Partial Information. SAGT 2019: 49-62 - Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta:
The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is). SAGT 2019: 109-122 - Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. SAGT 2019: 123-136 - Sigal Oren, Dolav Soker:
Principal-Agent Problems with Present-Biased Agents. SAGT 2019: 237-251 - Zoi Terzopoulou, Ulle Endriss:
Optimal Truth-Tracking Rules for the Aggregation of Incomplete Judgments. SAGT 2019: 298-311 - Dimitris Fotakis, Evangelos Markakis:
Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Athens, Greece, September 30 - October 3, 2019, Proceedings. Lecture Notes in Computer Science 11801, Springer 2019, ISBN 978-3-030-30472-0 [contents]
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-04-27 15:51 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