language:
Find link is a tool written by Edward Betts.searching for algorithmic game theory 62 found (331 total)
alternate case: Algorithmic game theory
Tim Roughgarden
(491 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 (928 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 theMohammad Hajiaghayi (597 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 gameConcision (990 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 (794 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 GoldreichDouble auction (3,194 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-0521872829Robert 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 UniversityJohn von Neumann Theory Prize (637 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,899 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; RoughgardenShang-Hua Teng (451 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". InCompetitive equilibrium (3,841 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 NoamConstantinos 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 machineChristos Papadimitriou (981 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. RetrievedStrongly proportional division (1,951 words) [view diff] case mismatch in snippet view article find links to article
Rothe, Jörg (ed.). Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division. Cham: SpringerManfred 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-9Anna 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 TextsGeneralized second-price auction (1,538 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,663 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-0Combinatorial auction (1,079 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-0Kate Larson (computer scientist) (332 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, SeptemberMoshe Tennenholtz (376 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 FacultyAriel D. Procaccia (391 words) [view diff] exact match in snippet view article find links to article
Fellow in 2024. Procaccia is an emeritus blogger on the popular algorithmic game theory blog "Turing's Invisible Hand." "Home". Ariel Procaccia. RetrievedLemke–Howson algorithm (1,391 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-9Egalitarian item allocation (2,984 words) [view diff] case mismatch in snippet view article find links to article
Voudouris, Alexandros (eds.). "Online Max-min Fair Allocation". Algorithmic Game Theory. Cham: Springer International Publishing: 526–543. doi:10Price of stability (1,388 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-0Revenue equivalence (2,645 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-0Budget-balanced mechanism (1,034 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:Gibbard–Satterthwaite theorem (2,646 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,401 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 LearningProfit extraction mechanism (938 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-0Single-parameter utility (1,303 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,957 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: SpringerUP 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,502 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-0Agent-based computational economics (1,982 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 atCompetition (5,422 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 atFacility 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-0Schelling's model of segregation (1,628 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_13Single peaked preferences (1,530 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: SpringerMultiple subset sum (1,613 words) [view diff] case mismatch in snippet view article find links to article
Announcement: On the Fair Subset Sum Problem". In Hoefer, Martin (ed.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 9347. Berlin, Heidelberg:Vickrey–Clarke–Groves mechanism (2,484 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.03152Random-sampling mechanism (2,241 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,471 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: SpringerPrior-free mechanism (1,113 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-0Consensus estimate (717 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-0List of unsolved problems in fair division (3,593 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 TextsOptimal job scheduling (2,964 words) [view diff] case mismatch in snippet view article find links to article
Kontogiannis, Spyros; Koutsoupias, Elias; Spirakis, Paul G. (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Berlin, Heidelberg: SpringerMedian voter theorem (4,135 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-9Fully 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:Monotonicity (mechanism design) (1,219 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-0Congestion game (7,315 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-0Mathematical economics (10,734 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 atProportional cake-cutting with different entitlements (3,039 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.03152Quadratic voting (3,617 words) [view diff] exact match in snippet view article find links to article
1323–1371. doi:10.2307/3481262. ISSN 0008-1221. JSTOR 3481262. Algorithmic game theory. Nisan, Noam. Cambridge: Cambridge University Press. 2007. ISBN 978-0-511-35572-1Fractional Pareto efficiency (3,158 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,381 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-0PLS (complexity) (5,471 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:2205Consensus splitting (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,607 words) [view diff] case mismatch in snippet view article find links to article
Budgeting". In Deligkas, Argyrios; Filos-Ratsikas, Aris (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Cham: Springer Nature SwitzerlandBudget-proposal aggregation (4,497 words) [view diff] case mismatch in snippet view article find links to article
Mechanism". In Deligkas, Argyrios; Filos-Ratsikas, Aris (eds.). Algorithmic Game Theory. Lecture Notes in Computer Science. Vol. 14238. Cham: Springer