language:
Find link is a tool written by Edward Betts.searching for Algorithmic game theory 71 found (130 total)
alternate case: algorithmic game theory
Tim Roughgarden
(488 words)
[view diff]
case mismatch in snippet
view article
find links to article
Prize in 2016. Roughgarden is a co-editor of the 2016 textbook Algorithmic Game Theory, as well as the author of two chapters (Introduction to the InefficiencyDistributed algorithmic mechanism design (918 words) [view diff] no match in snippet view article find links to article
Distributed algorithmic mechanism design (DAMD) is an extension of algorithmic mechanism design. DAMD differs from Algorithmic mechanism design since theConcision (983 words) [view diff] exact match in snippet view article find links to article
structures balance minimal storage use against efficiency of access. In algorithmic game theory, a succinct game is one that may be accurately described in a simplerKnuth Prize (761 words) [view diff] case mismatch in snippet view article find links to article
(PDF), ACM, May 17, 2015 ACM Awards Knuth Prize to Pioneer of Algorithmic Game Theory, ACM, September 8, 2016 2017 Knuth prize is Awarded to Oded GoldreichGraphical game theory (439 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0All-pay auction (1,915 words) [view diff] case mismatch in snippet view article find links to article
Nuffield College, Oxford University, Princeton University Press, 2004 Algorithmic Game Theory. Vazirani, Vijay V; Nisan, Noam; Roughgarden, Tim; Tardos, Eva;Mohammad Hajiaghayi (588 words) [view diff] exact match in snippet view article find links to article
and algorithmic game theory." Hajiaghayi has been elected as an IEEE Fellow in 2019 "for contributions to algorithmic graph theory and to algorithmic gameCorrelated equilibrium (1,237 words) [view diff] exact match in snippet view article find links to article
Downloadable free online. Éva Tardos (2004) Class notes from Algorithmic game theory (note an important typo) [1] Iskander Karibzhanov. MATLAB codeRobert Kleinberg (333 words) [view diff] exact match in snippet view article find links to article
learning, network coding and greedy embedding, social networks and algorithmic game theory. Robert Kleinberg received a B.A. in mathematics from Cornell UniversityEpsilon-equilibrium (1,402 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0John von Neumann Theory Prize (628 words) [view diff] exact match in snippet view article find links to article
notably in linear programming, combinatorial optimization, and algorithmic game theory. 2013 Michel Balinski 2012 George Nemhauser and Laurence WolseyFisher market (2,864 words) [view diff] case mismatch in snippet view article find links to article
Market Equilibrium" (PDF). Advanced Topics in Machine Learning and Algorithmic Game Theory. Retrieved 15 March 2016. Vazirani, Vijay V.; Nisan, Noam; RoughgardenCompetitive equilibrium (3,693 words) [view diff] case mismatch in snippet view article find links to article
Noam; Roughgarden, Tim; Tardos, Eva; Vazirani, Vijay (eds.). Algorithmic Game Theory (PDF). pp. 277–279. ISBN 978-0521872829. Liad Blumrosen and NoamRevelation principle (1,066 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Constantinos Daskalakis (811 words) [view diff] exact match in snippet view article find links to article
the 2022 class of ACM Fellows, "for fundamental contributions to algorithmic game theory, mechanism design, sublinear algorithms, and theoretical machineShang-Hua Teng (439 words) [view diff] exact match in snippet view article find links to article
contributions to scalable algorithm design, mesh generation, and algorithmic game theory, and for pioneering smoothed analysis of linear programming". InPotential game (1,849 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Generalized second-price auction (1,483 words) [view diff] case mismatch in snippet view article find links to article
S2CID 2138064. S. Lahaie, D. Pennock, A. Saberi, and R. Vohra. Algorithmic Game Theory, chapter "Sponsored search auctions", pages 699–716. CambridgeFirst-price sealed-bid auction (1,648 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Best response (1,619 words) [view diff] case mismatch in snippet view article find links to article
Oxford University Press Nisan, N.; Roughgarden, T.; Tardos, É.; Vazirani, V.V. (2007), Algorithmic Game Theory (PDF), New York: Cambridge University PressCombinatorial auction (1,057 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Anna Bogomolnaia (376 words) [view diff] case mismatch in snippet view article find links to article
Rothe, Jörg (2015), Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, Springer TextsAriel D. Procaccia (349 words) [view diff] exact match in snippet view article find links to article
Welfare Prize. Procaccia is an emeritus blogger on the popular algorithmic game theory blog "Turing's Invisible Hand." "Home". Ariel Procaccia. RetrievedChristos Papadimitriou (980 words) [view diff] case mismatch in snippet view article find links to article
2012. "Three Papers Cited for Laying Foundation of Growth in Algorithmic Game Theory". 16 May 2012. Archived from the original on 18 July 2013. RetrievedKate Larson (computer scientist) (302 words) [view diff] case mismatch in snippet view article
Fotakis, Dimitris; Markakis, Evangelos (16 September 2019). Algorithmic Game Theory: 12th International Symposium, SAGT 2019, Athens, Greece, SeptemberMajority criterion (1,804 words) [view diff] case mismatch in snippet view article find links to article
Jörg (2015-08-18). Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Springer. p. 231Revenue equivalence (2,515 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Manfred K. Warmuth (382 words) [view diff] case mismatch in snippet view article find links to article
Noam; Roughgarden, Tim; Tardos, Éva; Vazirani, Vijay V. (eds.), Algorithmic Game Theory, Cambridge University Press, pp. 79–101, ISBN 978-0-521-87282-9Lemke–Howson algorithm (1,367 words) [view diff] case mismatch in snippet view article find links to article
Christos H. (2007). "The Complexity of Finding Nash Equilibria". Algorithmic Game Theory. pp. 29–52. doi:10.1017/CBO9780511800481.004. ISBN 978-0-521-87282-9Stable marriage problem (2,408 words) [view diff] case mismatch in snippet view article find links to article
Noam; Roughgarden, Tim; Tardos, Eva; Vazirani, Vijay (eds.). Algorithmic Game Theory. pp. 255–262. ISBN 978-0521872829. Gusfield, D.; Irving, R.W. (1989)Price of stability (1,310 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Monotonicity (mechanism design) (1,180 words) [view diff] case mismatch in snippet view article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Budget-balanced mechanism (1,031 words) [view diff] case mismatch in snippet view article find links to article
Double-Auction Mechanism". In Gairing, Martin; Savani, Rahul (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 9928. Berlin, Heidelberg:Single-parameter utility (1,248 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Agent-based computational economics (1,796 words) [view diff] case mismatch in snippet view article find links to article
Behavior, 35(1-2), pp. 166–196. • Noam Nisan et al., ed. (2007). Algorithmic Game Theory, Cambridge University Press. Description Archived 5 May 2012 atMoshe Tennenholtz (373 words) [view diff] exact match in snippet view article find links to article
elected as an ACM Fellow in 2019 "for contributions to AI and algorithmic game theory". "Moshe Tennenholtz". Industrial Engineering and Management FacultyStrategyproofness (2,360 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Randomized weighted majority algorithm (2,325 words) [view diff] case mismatch in snippet view article find links to article
Predicting From Experts Advice Uri Feige, Robi Krauthgamer, Moni Naor. Algorithmic Game Theory Nika Haghtalab 2020 Theoretical Foundations of Machine LearningGibbard–Satterthwaite theorem (2,660 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Fair allocation of items and money (3,950 words) [view diff] case mismatch in snippet view article find links to article
with Subsidy". In Fotakis, Dimitris; Markakis, Evangelos (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 11801. Cham: SpringerProfit extraction mechanism (925 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Double auction (3,185 words) [view diff] case mismatch in snippet view article find links to article
Noam; Roughgarden, Tim; Tardos, Eva; Vazirani, Vijay (eds.). Algorithmic Game Theory. pp. 230–231. doi:10.1017/CBO9780511800481.011. ISBN 978-0521872829UP Diliman Department of Computer Science (1,054 words) [view diff] exact match in snippet view article find links to article
(visualization and implementations, algorithmics for hard problems, algorithmic game theory, scheduling problem), combinatorial networks, information technologyBayesian-optimal mechanism (1,461 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Facility location (competitive game) (766 words) [view diff] case mismatch in snippet view article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Single peaked preferences (1,376 words) [view diff] case mismatch in snippet view article find links to article
Complexity and Algorithms". In Harks, Tobias; Klimm, Max (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 12283. Cham: SpringerVickrey–Clarke–Groves mechanism (2,365 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Multiple subset sum (1,601 words) [view diff] case mismatch in snippet view article find links to article
Martin (ed.). "Brief Announcement: On the Fair Subset Sum Problem". Algorithmic Game Theory. Lecture Notes in Computer Science. 9347. Berlin, Heidelberg: Springer:Facility location (cooperative game) (464 words) [view diff] case mismatch in snippet view article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Median voter theorem (2,912 words) [view diff] case mismatch in snippet view article find links to article
Noam; Roughgarden, Tim; Tardos, Eva; Vazirani, Vijay (eds.). Algorithmic Game Theory. New York: Cambridge University Press. pp. 246–252. ISBN 978-0-521-87282-9Schelling's model of segregation (1,576 words) [view diff] case mismatch in snippet view article find links to article
Strategic Agents. Proceedings of the 11th International Symposium on Algorithmic Game Theory. pp. 137–149. arXiv:1806.08713. doi:10.1007/978-3-319-99660-8_13Competition (6,512 words) [view diff] case mismatch in snippet view article find links to article
Behavior, 35(1–2), pp. 166–96. • Noam Nisan et al., ed. (2007). Algorithmic Game Theory, Cambridge University Press. Description Archived 2012-05-05 atRandom-sampling mechanism (2,178 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Robertson–Webb query model (2,139 words) [view diff] case mismatch in snippet view article find links to article
(2018), "The Complexity of Cake Cutting with Unequal Shares", Algorithmic Game Theory, Springer International Publishing, pp. 19–30, arXiv:1709.03152Consensus estimate (656 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Prior-free mechanism (1,111 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Efficient approximately fair item allocation (5,397 words) [view diff] case mismatch in snippet view article find links to article
Spending-Constraint Utilities". In Bilò, Vittorio; Flammini, Michele (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 10504. Cham: SpringerOptimal job scheduling (2,975 words) [view diff] case mismatch in snippet view article find links to article
Approximate Pareto Efficiency in Routing and Load Balancing Games". Algorithmic Game Theory. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer:List of unsolved problems in fair division (3,566 words) [view diff] case mismatch in snippet view article find links to article
Indivisible Goods", Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, Springer TextsFully proportional representation (1,220 words) [view diff] case mismatch in snippet view article find links to article
for Single-Crossing Electorates". In Vöcking, Berthold (ed.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 8146. Berlin, Heidelberg:Congestion game (7,253 words) [view diff] case mismatch in snippet view article find links to article
Vijay V.; Nisan, Noam; Roughgarden, Tim; Tardos, Éva (2007). Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Proportional cake-cutting with different entitlements (2,901 words) [view diff] case mismatch in snippet view article find links to article
(2018), "The Complexity of Cake Cutting with Unequal Shares", Algorithmic Game Theory, Springer International Publishing, pp. 19–30, arXiv:1709.03152Truthful cake-cutting (3,311 words) [view diff] case mismatch in snippet view article find links to article
Kontogiannis, Spyros C.; Koutsoupias, Elias; Spirakis, Paul G. (eds.). Algorithmic Game Theory – Third International Symposium, SAGT 2010, Athens, Greece, OctoberFractional Pareto efficiency (3,138 words) [view diff] case mismatch in snippet view article find links to article
In Caragiannis, Ioannis; Hansen, Kristoffer Arnsfelt (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 12885. Cham: SpringerMarket equilibrium computation (4,073 words) [view diff] case mismatch in snippet view article find links to article
Combinatorial Algorithms for Market Equilibria / Vijay V. Vazirani". Algorithmic Game Theory (PDF). Cambridge, UK: Cambridge University Press. ISBN 0-521-87282-0Egalitarian item allocation (2,851 words) [view diff] case mismatch in snippet view article find links to article
Fair and Efficient Allocations when Valuations Don't Add up". Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 12283. pp. 32–46. arXiv:2003Mathematical economics (13,530 words) [view diff] case mismatch in snippet view article find links to article
2018-10-14 at the Wayback Machine. Nisan, Noam, et al., ed. (2007). Algorithmic Game Theory, Cambridge University Press. Description Archived 2012-05-05 atQuadratic voting (4,153 words) [view diff] exact match in snippet view article find links to article
(1–2): 125–149. doi:10.1007/s11127-017-0412-5. S2CID 157660093. Algorithmic game theory. Nisan, Noam. Cambridge: Cambridge University Press. 2007. ISBN 978-0-511-35572-1PLS (complexity) (5,283 words) [view diff] case mismatch in snippet view article
(2022). "On the Impact of Player Capability on Congestion Games". Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 13584. pp. 311–328. arXiv:2205Exact division (5,997 words) [view diff] case mismatch in snippet view article find links to article
Mossel, Elchanan; Tamuz, Omer (2010). "Truthful Fair Division". Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 6386. pp. 288–299. arXiv:1003Donor coordination (2,581 words) [view diff] case mismatch in snippet view article find links to article
"Coordinating Monetary Contributions in Participatory Budgeting". Algorithmic Game Theory. Lecture Notes in Computer Science. Cham: Springer Nature Switzerland: