![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 27 matches
- 2016
- George Christodoulou
, Stefano Leonardi, Alkmini Sgouritsa:
Designing Cost-Sharing Methods for Bayesian Games. SAGT 2016: 327-339 - Guy Avni, Thomas A. Henzinger, Orna Kupferman:
Dynamic Resource Allocation Games. SAGT 2016: 153-166 - Haris Aziz
, Péter Biró, Serge Gaspers, Ronald de Haan, Nicholas Mattei
, Baharak Rastegari
:
Stable Matching with Uncertain Linear Preferences. SAGT 2016: 195-206 - Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick
:
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. SAGT 2016: 169-181 - Vittorio Bilò
:
On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games. SAGT 2016: 93-104 - Ioannis Caragiannis, Angelo Fanelli
:
An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling. SAGT 2016: 315-326 - Ankit Chauhan, Pascal Lenzner, Anna Melnichenko, Martin Münn:
On Selfish Creation of Robust Networks. SAGT 2016: 141-152 - Riccardo Colini-Baldeschi, Roberto Cominetti
, Marco Scarsini
:
On the Price of Anarchy of Highly Congested Nonatomic Network Games. SAGT 2016: 117-128 - Ágnes Cseh, Robert W. Irving, David F. Manlove
:
The Stable Roommates Problem with Short Lists. SAGT 2016: 207-219 - Argyrios Deligkas, John Fearnley, Paul G. Spirakis:
Lipschitz Continuity and Approximate Equilibria. SAGT 2016: 15-26 - Guillaume Ducoffe:
The Parallel Complexity of Coloring Games. SAGT 2016: 27-39 - Stéphane Durand, Bruno Gaujal:
Complexity and Optimality of the Best Response Algorithm in Random Potential Games. SAGT 2016: 40-51 - Salman Fadaei, Martin Bichler:
Truthfulness and Approximation with Value-Maximizing Bidders. SAGT 2016: 235-246 - Amos Fiat, Yishay Mansour, Mariano Schain:
History-Independent Distributed Multi-agent Learning. SAGT 2016: 77-89 - Matthias Gerstgrasser, Paul W. Goldberg
, Elias Koutsoupias:
Revenue Maximization for Market Intermediation with Correlated Priors. SAGT 2016: 273-285 - Yiannis Giannakopoulos
, Elias Koutsoupias, Maria Kyropoulou:
The Anarchy of Scheduling Without Money. SAGT 2016: 302-314 - Paul W. Goldberg
, Francisco J. Marmolejo Cossío
, Zhiwei Steven Wu:
Logarithmic Query Complexity for Approximate Nash Computation in Large Games. SAGT 2016: 3-14 - Kristoffer Arnsfelt Hansen
, Rasmus Ibsen-Jensen
, Michal Koucký
:
The Big Match in Small Space - (Extended Abstract). SAGT 2016: 64-76 - Jasper de Jong, Max Klimm, Marc Uetz:
Efficiency of Equilibria in Uniform Matroid Congestion Games. SAGT 2016: 105-116 - Christos Kaklamanis, Panagiotis Kanellopoulos
, Konstantinos Papaioannou:
The Price of Stability of Simple Symmetric Fractional Hedonic Games. SAGT 2016: 220-232 - Edon Kelmendi, Hugo Gimbert:
Deciding Maxmin Reachability in Half-Blind Stochastic Games. SAGT 2016: 52-63 - Pieter Kleer, Guido Schäfer:
The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games. SAGT 2016: 129-140 - Evangelos Markakis, Orestis Telelis:
Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets. SAGT 2016: 247-259 - Reshef Meir:
Strong and Weak Acyclicity in Iterative Voting. SAGT 2016: 182-194 - Matús Mihalák, Paolo Penna, Peter Widmayer:
Bribeproof Mechanisms for Two-Values Domains. SAGT 2016: 289-301 - Erel Segal-Halevi
, Avinatan Hassidim, Yonatan Aumann:
SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism. SAGT 2016: 260-272 - Martin Gairing, Rahul Savani:
Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Liverpool, UK, September 19-21, 2016. Proceedings. Lecture Notes in Computer Science 9928, Springer 2016, ISBN 978-3-662-53353-6 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.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-03 13:26 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