Find link

language:

Find link is a tool written by Edward Betts.

searching for Algorithmic game theory 73 found (132 total)

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 Inefficiency

Distributed algorithmic mechanism design (919 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 the

Knuth Prize (791 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 Goldreich

Concision (996 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 simpler

Mohammad 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 game

All-pay auction (2,074 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;

Graphical game theory (583 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-0

Incentive compatibility (507 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-0

Correlated equilibrium (1,263 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 code

Robert 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 University

Double 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-0521872829

Epsilon-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-0

John 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 Wolsey

Fisher 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; Roughgarden

Shang-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". In

Competitive 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 Noam

Constantinos 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 machine

Christos 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. Retrieved

Manfred 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-9

Strongly 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: Springer

Potential game (1,907 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-0

Anna 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 Texts

First-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-0

Generalized second-price auction (1,539 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. Cambridge

Best response (1,603 words) [view diff] case mismatch in snippet view article find links to article

Nisan, N.; Roughgarden, T.; Tardos, É.; Vazirani, V. V. (2007), Algorithmic Game Theory (PDF), New York: Cambridge University Press Osborne, M. J.; Rubinstein

Kate 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, September

Combinatorial 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-0

Revelation principle (1,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-0

Ariel D. Procaccia (369 words) [view diff] exact match in snippet view article find links to article

2024 Kalai Prize. Procaccia is an emeritus blogger on the popular algorithmic game theory blog "Turing's Invisible Hand." "Home". Ariel Procaccia. Retrieved

Moshe 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 Faculty

Lemke–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-9

Price 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-0

Egalitarian item allocation (2,969 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:10

Revenue 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-0

Budget-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:

Stable matching problem (2,544 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)

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-0

Randomized 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 Learning

Profit 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-0

Single-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-0

Fair 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: Springer

UP 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 technology

Bayesian-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-0

Facility 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-0

Strategyproofness (2,611 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-0

Agent-based computational economics (1,860 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 at

Competition (5,391 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 at

Single 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: 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-0

Schelling'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_13

Multiple 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-0

Random-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-0

Robertson–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.03152

Median voter theorem (3,936 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-9

Efficient 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: Springer

Prior-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-0

Optimal job scheduling (2,974 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: Springer

Consensus 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-0

List 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 Texts

Fully 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-0

Congestion 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-0

Mathematical economics (10,736 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 at

Proportional 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.03152

Truthful cake-cutting (3,353 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, October

Quadratic voting (3,605 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-1

Market 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-0

Fractional 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: Springer

PLS (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:2205

Consensus 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:1003

Donor 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 Switzerland

Budget-proposal aggregation (4,013 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