![](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
- 2018
- Jing Chen, Bo Li
, Yingkai Li:
Information Elicitation for Bayesian Auctions. SAGT 2018: 43-55 - George Christodoulou
, Themistoklis Melissourgos
, Paul G. Spirakis:
Short Paper: Strategic Contention Resolution in Multiple Channels with Limited Feedback. SAGT 2018: 245-250 - Manel Ayadi, Nahla Ben Amor
, Jérôme Lang:
The Communication Burden of Single Transferable Vote, in Practice. SAGT 2018: 251-255 - Georgios Amanatidis
, George Christodoulou
, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou:
An Improved Envy-Free Cake Cutting Protocol for Four Agents. SAGT 2018: 87-99 - Antonios Antoniadis, Andrés Cristi:
A Near Optimal Mechanism for Energy Aware Scheduling. SAGT 2018: 31-42 - Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta:
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. SAGT 2018: 267-271 - Ankit Chauhan, Pascal Lenzner, Louise Molitor:
Schelling Segregation with Strategic Agents. SAGT 2018: 137-149 - Xujin Chen, Xiaodong Hu, Xiaohua Jia, Minming Li
, Zhongzheng Tang, Chenhao Wang
:
Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance. SAGT 2018: 256-260 - Xujin Chen, Xiaodong Hu, Chenhao Wang
:
The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty. SAGT 2018: 189-200 - Jing Chen, Samuel McCauley, Shikha Singh:
Efficient Rational Proofs with Strong Utility-Gap Guarantees. SAGT 2018: 150-162 - Wei Chen
, Xiaohan Shan, Xiaoming Sun, Jialin Zhang
:
Coreness of Cooperative Games with Truncated Submodular Profit Functions. SAGT 2018: 56-68 - Yukun Cheng, Donglei Du
, Qiaoming Han:
A Hashing Power Allocation Game in Cryptocurrencies. SAGT 2018: 226-238 - Ágnes Cseh, Tamás Fleiner:
The Complexity of Cake Cutting with Unequal Shares. SAGT 2018: 19-30 - Marcin Dziubinski
, Jaideep Roy:
Hide and Seek Game with Multiple Resources. SAGT 2018: 82-86 - Edith Elkind:
Restricted Preference Domains in Social Choice: Two Perspectives. SAGT 2018: 12-18 - Moran Feldman
, Rica Gonen:
Removal and Threshold Pricing: Truthful Two-Sided Markets with Multi-dimensional Participants. SAGT 2018: 163-175 - Jugal Garg, Peter McGlaughlin:
A Truthful Mechanism for Interval Scheduling. SAGT 2018: 100-112 - Amy Greenwald
, Takehiro Oyakawa, Vasilis Syrgkanis:
On Revenue-Maximizing Mechanisms Assuming Convex Costs. SAGT 2018: 113-124 - Frits Hof, Walter Kern, Sascha Kurz, Daniël Paulusma
:
Simple Games Versus Weighted Voting Games. SAGT 2018: 69-81 - Gerold Jäger, Frank Drewes:
An Optimal Strategy for Static Black-Peg Mastermind with Three Pegs. SAGT 2018: 261-266 - Christos Kaklamanis, Panagiotis Kanellopoulos, Dimitris Patouchas:
On the Price of Stability of Social Distance Games. SAGT 2018: 125-136 - Elias Koutsoupias, Philip Lazos:
Online Trading as a Secretary Problem. SAGT 2018: 201-212 - Zhize Li, Le Zhang, Zhixuan Fang, Jian Li:
A Two-Stage Mechanism for Ordinal Peer Assessment. SAGT 2018: 176-188 - Ta Duy Nguyen, Yair Zick
:
Resource Based Cooperative Games: Optimization, Fairness and Stability. SAGT 2018: 239-244 - Abdallah Saffidine, Anaëlle Wilczynski
:
Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation. SAGT 2018: 213-225 - Andrew Chi-Chih Yao:
On Revenue Monotonicity in Combinatorial Auctions. SAGT 2018: 1-11 - Xiaotie Deng:
Algorithmic Game Theory - 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings. Lecture Notes in Computer Science 11059, Springer 2018, ISBN 978-3-319-99659-2 [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-08-17 05: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