Остановите войну!
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 53 matches
- 2010
- Aadithya V. Karthik, Balaraman Ravindran, Tomasz P. Michalak, Nicholas R. Jennings:
Efficient Computation of the Shapley Value for Centrality in Networks. WINE 2010: 1-13 - Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni, Hamid Mahini, Afshin Nikzad:
Optimal Iterative Pricing over Social Networks (Extended Abstract). WINE 2010: 415-423 - Susanne Albers, Pascal Lenzner:
On Approximate Nash Equilibria in Network Design. WINE 2010: 14-25 - Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium Pricing with Positive Externalities (Extended Abstract). WINE 2010: 424-431 - Yonatan Aumann, Yair Dombb:
The Efficiency of Fair Division with Connected Pieces. WINE 2010: 26-37 - Yoram Bachrach, Peter B. Key, Morteza Zadimoghaddam:
Collusion in VCG Path Procurement Auctions. WINE 2010: 38-49 - Yoram Bachrach, Maria Polukarov, Nicholas R. Jennings:
The Good, The Bad and The Cautious: Safety Level Cooperative Games. WINE 2010: 432-443 - Maria-Florina Balcan, Florin Constantin:
Sequential Item Pricing for Unlimited Supply. WINE 2010: 50-62 - Felipe Balmaceda, Santiago R. Balseiro, José R. Correa, Nicolás E. Stier Moses:
The Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem. WINE 2010: 63-74 - Davide Bilò, Luciano Gualà, Stefano Leucci, Guido Proietti:
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game. WINE 2010: 75-86 - Christian Borgs, Jennifer T. Chayes, Adam Tauman Kalai, Azarakhsh Malekian, Moshe Tennenholtz:
A Novel Approach to Propagating Distrust. WINE 2010: 87-105 - Allan Borodin, Yuval Filmus, Joel Oren:
Threshold Models for Competitive Influence in Social Networks. WINE 2010: 539-550 - Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454 - Niv Buchbinder, Kamal Jain, Mohit Singh:
Incentives in Online Auctions via Linear Programming. WINE 2010: 106-117 - Ozan Candogan, Kostas Bimpikis, Asuman E. Ozdaglar:
Optimal Pricing in the Presence of Local Network Effects. WINE 2010: 118-132 - L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Local Dynamics in Bargaining Networks via Random-Turn Games. WINE 2010: 133-144 - Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. WINE 2010: 496-504 - Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Selective Call Out and Real Time Bidding. WINE 2010: 145-157 - Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, S. Muthukrishnan:
Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions. WINE 2010: 158-169 - George Christodoulou, Khaled M. Elbassioni, Mahmoud Fouz:
Truthful Mechanisms for Exhibitions. WINE 2010: 170-181 - George Christodoulou, Annamária Kovács, Rob van Stee:
A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. WINE 2010: 182-193 - Fan Chung Graham, Stephen J. Young:
Braess's Paradox in Large Sparse Graphs. WINE 2010: 194-208 - Vincent Conitzer, Nicole Immorlica, Joshua Letchford, Kamesh Munagala, Liad Wagman:
False-Name-Proofness in Social Networks. WINE 2010: 209-221 - Chuangyin Dang, Yinyu Ye:
The Complexity of Determining the Uniqueness of Tarski's Fixed Point under the Lexicographic Ordering. WINE 2010: 455-461 - Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swamy:
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply. WINE 2010: 462-472 - Edith Elkind, Piotr Faliszewski:
Approximation Algorithms for Campaign Management. WINE 2010: 473-482 - Angelo Fanelli, Michele Flammini, Luca Moscardelli:
Stackelberg Strategies for Network Design Games. WINE 2010: 222-233 - Dimitris Fotakis, Christos Tzamos:
Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games. WINE 2010: 234-245 - Xi Alice Gao, Yiling Chen:
An Axiomatic Characterization of Continuous-Outcome Market Makers. WINE 2010: 505-514 - Anupam Gupta, Aaron Roth, Grant Schoenebeck, Kunal Talwar:
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms. WINE 2010: 246-257
skipping 23 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-04-27 13:23 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