The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "SAGT"( http://dblp.L3S.de/Venues/SAGT )

URL (DBLP): http://dblp.uni-trier.de/db/conf/sagt

Publication years (Num. hits)
2008 (32) 2009 (32) 2010 (31) 2011 (29) 2012 (23) 2013 (23) 2014 (25) 2015 (30) 2016 (27) 2017 (27) 2018 (27) 2019 (26) 2020 (22) 2021 (31) 2022 (33) 2023 (24)
Publication types (Num. hits)
inproceedings(426) proceedings(16)
Venues (Conferences, Journals, ...)
SAGT(442)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 11 keywords

Results
Found 442 publication records. Showing 442 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michal Feldman, Tom Ron Capacitated Network Design Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Hu Fu 0001, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii Ad Auctions with Data. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul W. Goldberg, Arnoud Pastink On the Communication Complexity of Approximate Nash Equilibria. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vahab S. Mirrokni, Nithum Thain, Adrian Vetta A Theoretical Examination of Practical Game Playing: Lookahead Search. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Paul W. Goldberg, Antony McCabe Commodity Auctions and Frugality Ratios. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Dimitris Fotakis 0001, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis On the Hardness of Network Design for Bottleneck Routing Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vincenzo Auletta, George Christodoulou 0001, Paolo Penna Mechanisms for Scheduling with Single-Bit Private Values. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Nuh Aygün Dalkiran, Moshe Hoffman, Ramamohan Paturi, Daniel Ricketts 0001, Andrea Vattani Common Knowledge and State-Dependent Equilibria. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michal Feldman, John K. Lai Mechanisms and Impossibilities for Truthful, Envy-Free Allocations. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Diodato Ferraioli, Paul W. Goldberg, Carmine Ventre Decentralized Dynamics for Finite Opinion Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Marios Mavronicolas The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1K. Ruben Brokkelkamp, Mees J. de Vries Convergence of Ordered Improvement Paths in Generalized Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Sylvain Béal, Eric Rémila, Philippe Solal An Optimal Bound to Access the Core in TU-Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Maria J. Serna (eds.) Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Laurent Gourvès, Jérôme Monnot, Stefano Moretti 0001, Kim Thang Nguyen Congestion Games with Capacitated Resources. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Krzysztof R. Apt, Sunil Simon A Classification of Weakly Acyclic Games. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Evangelos Markakis, Orestis Telelis Uniform Price Auctions: Equilibria and Efficiency. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Marios Mavronicolas, Burkhard Monien Minimizing Expectation Plus Variance. Search on Bibsonomy SAGT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Bruno Escoffier, Laurent Gourvès, Jérôme Monnot The Price of Optimum in a Matching Game. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Roee Engelberg, Michael Schapira Weakly-Acyclic (Internet) Routing Games. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Giuseppe Persiano (eds.) Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Haris Aziz 0001, Felix Brandt 0001, Paul Harrenstein Pareto Optimality in Coalition Formation. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Elias Koutsoupias Scheduling without Payments. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Elizabeth Bodine-Baron, Christina Lee, Anthony Chong, Babak Hassibi, Adam Wierman Peer Effects and Stability in Matching Markets. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Noam Berger, Michal Feldman, Ofer Neiman, Mishael Rosenthal Dynamic Inefficiency: Anarchy without Stability. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Marco Comi, Bhaskar DasGupta, Michael Schapira, Venkatakumar Srinivasan On Communication Protocols That Compute Almost Privately. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Ameya Hate, Koushik Kar Strategic Pricing in Next-Hop Routing with Elastic Demands. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Panagiota N. Panagopoulou, Paul G. Spirakis Random Bimatrix Games Are Asymptotically Easy to Solve (A Simple Proof). Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Patrick R. Jordan, Mohammad Mahdian, Sergei Vassilvitskii, Erik Vee The Multiple Attribution Problem in Pay-Per-Conversion Advertising. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Evdokia Nikolova, Nicolás E. Stier Moses Stochastic Selfish Routing. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Brautbar, Michael J. Kearns A Clustering Coefficient Network Formation Game. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ning Chen 0005, Xiaotie Deng Computation and Incentives of Competitive Equilibria in a Matching Market. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dimitris Fotakis 0001, Piotr Krysta, Orestis Telelis Externalities among Advertisers in Sponsored Search. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Oskar Skibski Steady Marginality: A Uniform Approach to Shapley Value for Games with Externalities. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Yossi Azar, Ety Khaitzin Prompt Mechanism for Ad Placement over Time. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Pascal Lenzner On Dynamics in Basic Network Creation Games. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Orit Arzi, Yonatan Aumann, Yair Dombb Throw One's Cake - and Eat It Too. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bruno Codenotti Computational Game Theory. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vincenzo Bonifaci, Mahyar Salek, Guido Schäfer Efficiency of Restricted Tolls in Non-atomic Network Routing Games. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Lisa Fleischer, Zhenghui Wang Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Marios Mavronicolas Complexity of Rational and Irrational Nash Equilibria. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Asaph Arnon, Yishay Mansour Repeated Budgeted Second Price Ad Auction. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Shaili Jain, David C. Parkes Combinatorial Agency of Threshold Functions. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Long 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. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Krzysztof R. Apt, Evangelos Markakis Diffusion in Social Networks with Competing Products. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Eyal Gofer, Yishay Mansour Pricing Exotic Derivatives Using Regret Minimization. Search on Bibsonomy SAGT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni Nash Equilibria in Fisher Market. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Amos Fiat, Christos H. Papadimitriou When the Players Are Not Expectation Maximizers. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Gairing, Rahul Savani Computing Stable Outcomes in Hedonic Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum, Or Sheffet, Santosh S. Vempala On Nash-Equilibria of Approximation-Stable Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Elchanan Mossel, Omer Tamuz Truthful Fair Division. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli 0001, Gianpiero Monaco Improved Lower Bounds on the Price of Stability of Undirected Network Design Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Volodymyr Kuleshov, Adrian Vetta On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Hoefer 0001, Alexander Skopalik On the Complexity of Pareto-optimal Nash and Strong Equilibria. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Paul W. Goldberg How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard? Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Bugra Çaskurlu, Ameya Hate Partition Equilibrium Always Exists in Resource Selection Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Rajgopal Kannan, Costas Busch Bottleneck Congestion Games with Logarithmic Price of Anarchy. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Noam Hazon, Edith Elkind Complexity of Safe Strategic Voting. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Inbal Talgam-Cohen A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yonatan Aumann, Yair Dombb Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Constantinos Daskalakis, Rafael M. Frongillo, Christos H. Papadimitriou, George Pierrakos, Gregory Valiant On Learning Algorithms for Nash Equilibria. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Uriel Feige, Moshe Tennenholtz Responsive Lotteries. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Matús Mihalák, Jan Christoph Schlegel The Price of Anarchy in Network Creation Games Is (Mostly) Constant. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gagan Goel, Chinmay Karande, Lei Wang 0010 Single-Parameter Combinatorial Auctions with Partially Public Valuations. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Dimitris Fotakis 0001, George Karakostas, Stavros G. Kolliopoulos On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Uri Nadav, Georgios Piliouras No Regret Learning in Oligopolies: Cournot vs. Bertrand. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Reshef Meir, Yoram Bachrach, Jeffrey S. Rosenschein Minimal Subsidies in Expense Sharing Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Macko, Kate Larson, L'ubos Steskal Braess's Paradox for Flows over Time. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind A. Sohoni A Simplex-Like Algorithm for Fisher Markets. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Bart de Keijzer, Guido Schäfer, Orestis Telelis On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Gagan Goel, Vijay V. Vazirani A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Felix A. Fischer, Paul Harrenstein On the Rate of Convergence of Fictitious Play. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vijay V. Vazirani 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alex Fabrikant, Aaron D. Jaggard, Michael Schapira On the Structure of Weakly Acyclic Games. Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis (eds.) Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings Search on Bibsonomy SAGT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Christoph Dürr, Kim Thang Nguyen Non-clairvoyant Scheduling Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ronald Koch, Martin Skutella Nash Equilibria and the Price of Anarchy for Flows over Time. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Michal Feldman, Moshe Tennenholtz Partition Equilibrium. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Joshua Letchford, Vincent Conitzer, Kamesh Munagala Learning and Approximating the Optimal Strategy to Commit To. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko Swap Bribery. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tobias Harks, Max Klimm, Rolf H. Möhring Characterizing the Existence of Potential Functions in Weighted Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Clemens Thielen, Sven Oliver Krumke Truthful Mechanisms for Selfish Routing and Two-Parameter Agents. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Nash flows, selfish routing, algorithmic mechanism design
1Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein The Cost of Stability in Coalitional Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Angelo Fanelli 0001, Michele Flammini, Luca Moscardelli Performances of One-Round Walks in Linear Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Asaf Levin On Equilibria for ADM Minimization Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Moshe Babaioff, Michal Feldman, Noam Nisan Free-Riding and Free-Labor in Combinatorial Agency. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz A New Derandomization of Auctions. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Satish V. Ukkusuri Equilibria in Dynamic Selfish Routing. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1José R. Correa, Nicolás Figueroa On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF JEL Classification C60, C72, D44
1Marios Mavronicolas, Vicky G. Papadopoulou (eds.) Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Dov Monderer Monotonicity in Mechanism Design. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Andrew Byde, Maria Polukarov, Nicholas R. Jennings Games with Congestion-Averse Utilities. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Sanmay Das, Yonatan Naamad Anarchy, Stability, and Utopia: Creating Better Matchings. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tanmoy Chakraborty 0001, Sanjeev Khanna Nash Dynamics in Constant Player and Bounded Jump Congestion Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002 The Computational Complexity of Weak Saddles. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Elliot Anshelevich, Bugra Çaskurlu Price of Stability in Survivable Network Design. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Felix Brandt 0001, Markus Brill, Felix A. Fischer, Paul Harrenstein On the Complexity of Iterated Weak Dominance in Constant-Sum Games. Search on Bibsonomy SAGT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #301 - #400 of 442 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license