• 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.

found 32 matches

• 2009
• 
  Elliot Anshelevich, Bugra Çaskurlu:
  Price of Stability in Survivable Network Design. SAGT 2009: 208-219
• 
  Elliot Anshelevich, Sanmay Das, Yonatan Naamad:
  Anarchy, Stability, and Utopia: Creating Better Matchings. SAGT 2009: 159-170
• 
  Elliot Anshelevich, Satish V. Ukkusuri:
  Equilibria in Dynamic Selfish Routing. SAGT 2009: 171-182
• 
  Krzysztof R. Apt, Arantza Estévez-Fernández:
  Sequential Pivotal Mechanisms for Public Project Problems. SAGT 2009: 85-96
• 
  Moshe Babaioff, Michal Feldman, Noam Nisan:
  Free-Riding and Free-Labor in Combinatorial Agency. SAGT 2009: 109-121
• 
  Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein:
  The Cost of Stability in Coalitional Games. SAGT 2009: 122-134
• 
  Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz:
  A New Derandomization of Auctions. SAGT 2009: 233-237
• 
  André Berger, Rudolf Müller, Seyed Hossein Naeemi:
  Characterizing Incentive Compatibility for Convex Valuations. SAGT 2009: 24-35
• 
  Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli:
  Performances of One-Round Walks in Linear Congestion Games. SAGT 2009: 311-322
• 
  Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann:
  The Computational Complexity of Weak Saddles. SAGT 2009: 238-249
• 
  Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein:
  On the Complexity of Iterated Weak Dominance in Constant-Sum Games. SAGT 2009: 287-298
• 
  Andrew Byde, Maria Polukarov, Nicholas R. Jennings:
  Games with Congestion-Averse Utilities. SAGT 2009: 220-232
• 
  Tanmoy Chakraborty, Sanjeev Khanna:
  Nash Dynamics in Constant Player and Bounded Jump Congestion Games. SAGT 2009: 196-207
• 
  Po-An Chen, David Kempe:
  Bayesian Auctions with Friends and Foes. SAGT 2009: 335-346
• 
  Christine Chung, Evangelia Pyrga:
  Stochastic Stability in Internet Router Congestion Games. SAGT 2009: 183-195
• 
  José R. Correa, Nicolás Figueroa:
  On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design. SAGT 2009: 72-84
• 
  Shahar Dobzinski, Noam Nisan:
  A Modular Approach to Roberts' Theorem. SAGT 2009: 14-23
• 
  Christoph Dürr, Kim Thang Nguyen:
  Non-clairvoyant Scheduling Games. SAGT 2009: 135-146
• 
  Khaled M. Elbassioni, Rajiv Raman, Saurabh Ray, René Sitters:
  On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. SAGT 2009: 275-286
• 
  Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko:
  Swap Bribery. SAGT 2009: 299-310
• 
  Leah Epstein, Asaf Levin:
  On Equilibria for ADM Minimization Games. SAGT 2009: 347-358
• 
  Michal Feldman, Moshe Tennenholtz:
  Partition Equilibrium. SAGT 2009: 48-59
• 
  Tobias Harks, Max Klimm, Rolf H. Möhring:
  Characterizing the Existence of Potential Functions in Weighted Congestion Games. SAGT 2009: 97-108
• 
  Martin Hoefer, Lars Olbrich, Alexander Skopalik:
  Doing Good with Spam Is Hard. SAGT 2009: 263-274
• 
  Hyunwoo Jung, Kyung-Yong Chwa:
  The Balloon Popping Problem Revisited: Lower and Upper Bounds. SAGT 2009: 147-158
• 
  Ronald Koch, Martin Skutella:
  Nash Equilibria and the Price of Anarchy for Flows over Time. SAGT 2009: 323-334
• 
  Joshua Letchford, Vincent Conitzer, Kamesh Munagala:
  Learning and Approximating the Optimal Strategy to Commit To. SAGT 2009: 250-262
• 
  Dov Monderer:
  Monotonicity in Mechanism Design. SAGT 2009: 1
• 
  Abraham Othman, Tuomas Sandholm:
  Better with Byzantine: Manipulation-Optimal Mechanisms. SAGT 2009: 60-71
• 
  Clemens Thielen, Sven Oliver Krumke:
  Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. SAGT 2009: 36-47

skipping 2 more matches