Остановите войну!
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 29 matches
- 2011
- Elliot Anshelevich, Ameya Hate, Koushik Kar:
Strategic Pricing in Next-Hop Routing with Elastic Demands. SAGT 2011: 278-289 - Krzysztof R. Apt, Evangelos Markakis:
Diffusion in Social Networks with Competing Products. SAGT 2011: 212-223 - Asaph Arnon, Yishay Mansour:
Repeated Budgeted Second Price Ad Auction. SAGT 2011: 7-18 - Orit Arzi, Yonatan Aumann, Yair Dombb:
Throw One's Cake - and Eat It Too. SAGT 2011: 69-80 - Yossi Azar, Ety Khaitzin:
Prompt Mechanism for Ad Placement over Time. SAGT 2011: 19-30 - Haris Aziz, Felix Brandt, Paul Harrenstein:
Pareto Optimality in Coalition Formation. SAGT 2011: 93-104 - Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal:
Dynamic Inefficiency: Anarchy without Stability. SAGT 2011: 57-68 - Vittorio Bilò, Marios Mavronicolas:
Complexity of Rational and Irrational Nash Equilibria. SAGT 2011: 200-211 - Elizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman:
Peer Effects and Stability in Matching Markets. SAGT 2011: 117-129 - Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer:
Efficiency of Restricted Tolls in Non-atomic Network Routing Games. SAGT 2011: 302-313 - Michael Brautbar, Michael J. Kearns:
A Clustering Coefficient Network Formation Game. SAGT 2011: 224-235 - Ning Chen, Xiaotie Deng:
Computation and Incentives of Competitive Equilibria in a Matching Market. SAGT 2011: 2-6 - Bruno Codenotti:
Computational Game Theory. SAGT 2011: 1 - Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan:
On Communication Protocols That Compute Almost Privately. SAGT 2011: 44-56 - Roee Engelberg, Michael Schapira:
Weakly-Acyclic (Internet) Routing Games. SAGT 2011: 290-301 - Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
The Price of Optimum in a Matching Game. SAGT 2011: 81-92 - Lisa Fleischer, Zhenghui Wang:
Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. SAGT 2011: 166-177 - Dimitris Fotakis, Piotr Krysta, Orestis Telelis:
Externalities among Advertisers in Sponsored Search. SAGT 2011: 105-116 - Eyal Gofer, Yishay Mansour:
Pricing Exotic Derivatives Using Regret Minimization. SAGT 2011: 266-277 - Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. SAGT 2011: 178-189 - Shaili Jain, David C. Parkes:
Combinatorial Agency of Threshold Functions. SAGT 2011: 154-165 - Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee:
The Multiple Attribution Problem in Pay-Per-Conversion Advertising. SAGT 2011: 31-43 - Elias Koutsoupias:
Scheduling without Payments. SAGT 2011: 143-153 - Pascal Lenzner:
On Dynamics in Basic Network Creation Games. SAGT 2011: 254-265 - Evdokia Nikolova, Nicolás E. Stier Moses:
Stochastic Selfish Routing. SAGT 2011: 314-325 - Panagiota N. Panagopoulou, Paul G. Spirakis:
Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). SAGT 2011: 190-199 - Oskar Skibski:
Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities. SAGT 2011: 130-142 - Long Tran-Thanh, Maria Polukarov, Archie C. Chapman, Alex Rogers, Nicholas R. Jennings:
On the Existence of Pure Strategy Nash Equilibria in Integer-Splittable Weighted Congestion Games. SAGT 2011: 236-253 - Giuseppe Persiano:
Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6982, Springer 2011, ISBN 978-3-642-24828-3 [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-05-12 03:01 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