Остановите войну!
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 33 matches
- 2022
- Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío:
Decentralized Update Selection with Semi-strategic Experts. SAGT 2022: 403-420 - Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. SAGT 2022: 421-435 - Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. SAGT 2022: 436-453 - Liad Blumrosen, Yehonatan Mizrahi:
How Bad is the Merger Paradox? SAGT 2022: 23-40 - Ruben Brokkelkamp, Sjir Hoeijmakers, Guido Schäfer:
Greater Flexibility in Mechanism Design Through Altruism. SAGT 2022: 41-59 - Alon Cohen, Argyrios Deligkas, Moran Koren:
Learning Approximately Optimal Contracts. SAGT 2022: 331-346 - Jack Dippel, Adrian Vetta:
An Improved Bound for the Tree Conjecture in Network Creation Games. SAGT 2022: 241-257 - Martin Durand, Fanny Pascual:
Collective Schedules: Axioms and Algorithms. SAGT 2022: 454-471 - Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. SAGT 2022: 472-489 - Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. SAGT 2022: 133-150 - Edith Elkind, Sonja Kraiczy, Nicholas Teh:
Fairness in Temporal Slot Assignment. SAGT 2022: 490-507 - Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald:
Lookahead Auctions with Pooling. SAGT 2022: 60-77 - Matan Gilboa, Noam Nisan:
Complexity of Public Goods Games on Graphs. SAGT 2022: 151-168 - Paul W. Goldberg, Matthew J. Katzman:
PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games. SAGT 2022: 169-186 - Ronen Gradwohl, Moshe Tennenholtz:
Coopetition Against an Amazon. SAGT 2022: 347-365 - Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. SAGT 2022: 508-525 - Martin Hoefer, Lisa Wilhelmi:
Seniorities and Minimal Clearing in Financial Network Games. SAGT 2022: 187-204 - Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Financial Networks with Singleton Liability Priorities. SAGT 2022: 205-222 - Sahar Jahani, Bernhard von Stengel:
Automated Equilibrium Analysis of 2˟ 2˟ 2 Games. SAGT 2022: 223-237 - Yasushi Kawase, Hanna Sumita:
Online Max-min Fair Allocation. SAGT 2022: 526-543 - Aggelos Kiayias:
Decentralizing Information Technology: The Advent of Resource Based Systems. SAGT 2022: 3-19 - Fuga Kiyosue, Kenjiro Takazawa:
A Common Generalization of Budget Games and Congestion Games. SAGT 2022: 258-274 - Sophie Klumper, Guido Schäfer:
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. SAGT 2022: 78-93 - Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. SAGT 2022: 544-561 - Evangelos Markakis, Georgios Papasotiropoulos, Artem Tsikiridis:
On Improved Interval Cover Mechanisms for Crowdsourcing Markets. SAGT 2022: 94-112 - Reshef Meir, Riccardo Colini-Baldeschi:
Explicitly Simple Near-Tie Auctions. SAGT 2022: 113-130 - Georgios Piliouras, Lillian J. Ratliff, Ryann Sim, Stratis Skoulakis:
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games. SAGT 2022: 383-399 - Shaul Rosner, Tami Tamir:
Cost-Sharing Games with Rank-Based Utilities. SAGT 2022: 275-292 - Leora Schmerler, Noam Hazon, Sarit Kraus:
Strategic Voting in the Context of Stable-Matching of Teams. SAGT 2022: 562-579 - Roy Shahmoon, Rann Smorodinsky, Moshe Tennenholtz:
Data Curation from Privacy-Aware Agents. SAGT 2022: 366-382
skipping 3 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-22 20:07 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