Intelligence }
Download 1.9 Mb.
|
|
eprint = {http://www.pnas.org/content/102/43/15706.full.pdf+html} } @Article{WilsonGovindanUniqueness, author={Robert Wilson and Srihari Govindan}, title={Uniqueness of the index for {N}ash equilibria of two-player games}, journal={Economic Theory}, year=1997, volume={10}, number={3}, pages={541-549}, month={}, url={http://ideas.repec.org/a/spr/joecth/v10y1997i3p541-549.html} }
author = "Govindan S. and Wilson R.", title = "Equivalence and Invariance of the Index and Degree of {N}ash Equilibria", journal = "Games and Economic Behavior", volume = "21", year = "October 1997", pages = "56-61(6)", url = "http://www.ingentaconnect.com/content/ap/ga/1997/00000021/00000001/art00516" }
author = {Simsek, Alp and Ozdaglar, Asuman and Acemoglu, Daron}, title = {{Local Indices for Degenerate Variational Inequalities}}, journal = {MATHEMATICS OF OPERATIONS RESEARCH}, volume = {33}, number = {2}, pages = {291-300}, doi = {10.1287/moor.1070.0299}, year = {2008}, abstract = {We provide an index formula for solutions of variational inequality problems defined by a continuously differentiable function F over a convex set M represented by a finite number of inequality constraints. Our index formula can be applied when the solutions are nonsingular and possibly degenerate, as long as they also satisfy the injective normal map (INM) property, which is implied by strong stability. We show that when the INM property holds, the degeneracy in a solution can be removed by perturbing the function F slightly, i.e., the index of a degenerate solution is equal to the index of a nondegenerate solution of a slightly perturbed variational inequality problem. We further show that our definition of the index is equivalent to the topological index of the normal map at the zero corresponding to the solution. As an application of our index formula, we provide a global index theorem for variational inequalities which holds even when the solutions are degenerate. }, URL = {http://mor.journal.informs.org/cgi/content/abstract/33/2/291}, eprint = {http://mor.journal.informs.org/cgi/reprint/33/2/291.pdf} }
author = {Vincent Conitzer}, title = {Common voting rules as maximum likelihood estimators}, booktitle = {In Uncertainty in Artificial Intelligence: Proceedings of the Twentieth Conference (UAI2005}, year = {2005}, pages = {145--152}, publisher = {Morgan Kaufmann Publishers} }
ISSN = {0036-1399}, abstract = {A tournament is a finite set whose elements are called players, together with a binary relation called beating which is complete and asymmetric. A ranking of the players is an order-relation on the set of players. A ranking method is a function from the set of tournaments to the set of possible rankings. The ranking method commonly known as the "points system" is characterized by a set of axioms.}, author = {Rubinstein, Ariel}, copyright = {Copyright 1980 Society for Industrial and Applied Mathematics}, journal = {SIAM Journal on Applied Mathematics}, jstor_articletype = {Full Length Article}, jstor_date = {198002}, jstor_formatteddate = {Feb., 1980}, month = {feb}, number = {1}, pages = {108--111}, publisher = {Society for Industrial and Applied Mathematics}, title = {Ranking the Participants in a Tournament}, url = {http://links.jstor.org/sici?sici=0036-1399%28198002%2938%3A1%3C108%3ARTPIAT%3E2.0.CO%3B2-E}, volume = {38}, year = {1980}, }
ISSN = {0006-341X}, author = {Kendall, M. G.}, copyright = {Copyright 1955 International Biometric Society}, journal = {Biometrics}, jstor_articletype = {Full Length Article}, jstor_date = {195503}, jstor_formatteddate = {Mar., 1955}, month = {mar}, number = {1}, pages = {43--62}, publisher = {International Biometric Society}, title = {Further Contributions to the Theory of Paired Comparisons}, url = {http://links.jstor.org/sici?sici=0006-341X%28195503%2911%3A1%3C43%3AFCTTTO%3E2.0.CO%3B2-P}, volume = {11}, year = {1955}, }
ISSN = {0036-1445}, author = {Moon, J. W. and Pullman, N. J.}, copyright = {Copyright 1970 Society for Industrial and Applied Mathematics}, journal = {SIAM Review}, jstor_articletype = {Full Length Article}, jstor_date = {197007}, jstor_formatteddate = {Jul., 1970}, month = {jul}, number = {3}, pages = {384--399}, publisher = {Society for Industrial and Applied Mathematics}, title = {On Generalized Tournament Matrices}, url = {http://links.jstor.org/sici?sici=0036-1445%28197007%2912%3A3%3C384%3AOGTM%3E2.0.CO%3B2-I}, volume = {12}, year = {1970}, }
AUTHOR={Giora Slutzki and Oscar Volij}, TITLE={Ranking participants in generalized tournaments}, JOURNAL={International Journal of Game Theory}, YEAR=2005, VOLUME={33}, NUMBER={2}, PAGES={255-270}, MONTH={06}, NOTE={available at http://ideas.repec.org/a/spr/jogath/v33y2005i2p255-270.html} }
ISSN = {0373-1138}, abstract = {On considere en premier lieu le type le plus simple de "tournoi", dans lequel chacun de t joueurs $A_{1},A_{2},\ldots ,A_{t}$ rencontre une fois chacun des autres, le resultat de chaque jeu attribuant 1 point au joueur gagnant et 0 point au perdant. La question traitee dans cet article concerne la maniere de traduire les resultats d'un tournoi en classement des joueurs. Une methode courante consiste a prendre pour base du classement le nombre total de gains $a_{1},a_{2},\ldots ,a_{t}$ des joueurs, mais, dans ce cas, comment resoudre le probleme des ex-aequo? De toutes facons, des statistiques autres que les gains totaux peuvent etre utilisees, et l'on passe en revue differentes methodes qui ont ete proposees. Une partie importante de l'etude porte sur la comparaison des methodes d'apres leur performance dans de petits tournois ou l'intuition peut etre consideree comme un guide plus sur que des principes apparemment generaux. Bien qu'il soit commode d'utiliser le langage des tournois, le probleme du classement s'applique immediatement aux experiences comportant des comparaisons par paires, ou chaque objet $A_{i}$ (i = 1, 2,..., t) est compare une fois a chacun des autres, et le resultat exprime par une preference a l'un ou l'autre des objets. Quelques extensions a des situations plus generales sont indiquees.}, author = {David, H. A.}, copyright = {Copyright 1971 International Statistical Institute (ISI)}, journal = {Revue de l'Institut International de Statistique / Review of the International Statistical Institute}, jstor_articletype = {Full Length Article}, jstor_date = {1971}, jstor_formatteddate = {1971}, number = {2}, pages = {137--147}, publisher = {International Statistical Institute (ISI)}, title = {Ranking the Players in a Round Robin Tournament}, url = {http://links.jstor.org/sici?sici=0373-1138%281971%2939%3A2%3C137%3ARTPIAR%3E2.0.CO%3B2-V}, volume = {39}, year = {1971}, }
ISSN = {0022-0515}, author = {Szymanski, Stefan}, copyright = {Copyright 2003 American Economic Association}, journal = {Journal of Economic Literature}, jstor_articletype = {Full Length Article}, jstor_date = {200312}, jstor_formatteddate = {Dec., 2003}, month = {dec}, number = {4}, pages = {1137--1187}, publisher = {American Economic Association}, title = {The Economic Design of Sporting Contests}, url = {http://links.jstor.org/sici?sici=0022-0515%28200312%2941%3A4%3C1137%3ATEDOSC%3E2.0.CO%3B2-B}, volume = {41}, year = {2003}, }
AUTHOR={Christian Groh and Benny Moldovanu and Aner Sela and Uwe Sunde}, TITLE={Optimal Seedings in Elimination Tournaments}, YEAR=2003, MONTH=Jul, INSTITUTION={SFB/TR 15 Governance and the Efficiency of Economic Systems, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University}, TYPE={Discussion Papers}, NOTE={available at http://ideas.repec.org/p/trf/wpaper/140.html}, NUMBER={140} }
author = {Ajay Kalra and Mengze Shi}, title = {Designing Optimal Sales Contests: A Theoretical Perspective}, journal = {Marketing Science}, volume = {20}, number = {2}, year = {2001}, issn = {1526-548X}, pages = {170--193}, doi = {http://dx.doi.org/10.1287/mksc.20.2.170.10193}, publisher = {INFORMS}, address = {Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA}, }
AUTHOR={Moldovanu, Benny and Sela, Aner}, TITLE={The Optimal Allocation of Prizes in Contests}, YEAR=1999, MONTH=Jul, INSTITUTION={Sonderforschungsbereich 504, Universität Mannheim}, TYPE={Sonderforschungsbereich 504 Publications}, NOTE={available at http://ideas.repec.org/p/xrs/sfbmaa/99-75.html}, NUMBER={99-75} }
AUTHOR={Ryvkin, D., and Ortmann, A.}, TITLE={Three Prominent Tournament Formats: Predictive Power and Costs}, YEAR=2006, MONTH=Sep, INSTITUTION={The Center for Economic Research and Graduate Education - Economic Institute, Prague}, TYPE={CERGE-EI Working Papers}, }
AUTHOR={Harbring, Christine and Irlenbusch, Bernd}, TITLE={An experimental study on tournament design}, JOURNAL={Labour Economics}, YEAR=2003, VOLUME={10}, NUMBER={4}, PAGES={443-464}, MONTH={August}, NOTE={available at http://ideas.repec.org/a/eee/labeco/v10y2003i4p443-464.html} }
author = {Preston, Ian and Szymanski, Stefan}, title = {{Cheating in Contests}}, journal = {Oxf Rev Econ Policy}, volume = {19}, number = {4}, pages = {612-624}, doi = {10.1093/oxrep/19.4.612}, year = {2003}, }
ISSN = {0039-0526}, abstract = {Simulations of various kinds of sporting tournament have been carried out to assess their relative ability to produce as winner the best of the entrants. A strong contender when it is necessary to play relatively few games is the seeded draw and process. When the players are closely matched and there can be more games the round robin played twice is most effective.}, author = {Appleton, David R.}, copyright = {Copyright 1995 Royal Statistical Society}, group = {Focus on Sport}, journal = {The Statistician}, jstor_articletype = {Full Length Article}, jstor_date = {1995}, jstor_formatteddate = {1995}, keywords = {Croquet, Paired Comparisons, Sporting Tournaments}, number = {4}, pages = {529--538}, publisher = {Royal Statistical Society}, title = {May the Best Man Win?}, url = {http://links.jstor.org/sici?sici=0039-0526%281995%2944%3A4%3C529%3AMTBMW%3E2.0.CO%3B2-H}, volume = {44}, year = {1995}, }
ISSN = {0039-0526}, abstract = {We test whether attendances in team sports respond positively to the amount of uncertainty of the outcome between the competing teams in a match. Our results show that admissions at English soccer matches relate positively to the quality of teams involved and negatively to a measure of the relative win probabilities of the competing teams. The uncertainty measure is derived from a model of the betting market which corrects for specific biases tested for and identified in the odds in our data set. Although supporters appear to favour an uncertainty of outcome, a greater quality of strength across clubs may still yield a fall in aggregate attendance because of the extent to which home field advantage generates an uneven contest between similarly strong teams.}, author = {{Forrest, David} and {Simmons, Robert}}, copyright = {Copyright 2002 Royal Statistical Society}, journal = {The Statistician}, jstor_articletype = {Full Length Article}, jstor_date = {2002}, jstor_formatteddate = {2002}, keywords = {Competitive Balance, Home Advantage, Soccer, Sport}, number = {2}, pages = {229--241}, publisher = {Royal Statistical Society}, title = {Outcome Uncertainty and Attendance Demand in Sport: The Case of English Soccer}, url = {http://links.jstor.org/sici?sici=0039-0526%282002%2951%3A2%3C229%3AOUAADI%3E2.0.CO%3B2-E}, volume = {51}, year = {2002}, }
author = "Philip M. Long", title = "{SORTING} {AND} {SEARCHING} {WITH} {A} {FAULTY} {COMPARISON} {ORACLE}", number = "UCSC-CRL-92-15", year = "1992", url = "citeseer.ist.psu.edu/long92sorting.html" } @article{Bagchi:92, author = {A. Bagchi}, title = {On sorting in the presence of erroneous information}, journal = {Inf. Process. Lett.}, volume = {43}, number = {4}, year = {1992}, issn = {0020-0190}, pages = {213--215}, doi = {http://dx.doi.org/10.1016/0020-0190(92)90203-8}, publisher = {Elsevier North-Holland, Inc.}, address = {Amsterdam, The Netherlands, The Netherlands}, }
author = {Ryan S. Borgstrom and S. Rao Kosaraju}, title = {Comparison-based search in the presence of errors}, booktitle = {STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing}, year = {1993}, isbn = {0-89791-591-7}, pages = {130--136}, location = {San Diego, California, United States}, doi = {http://doi.acm.org/10.1145/167088.167129}, publisher = {ACM Press}, address = {New York, NY, USA}, }
author = {Uriel Feige and Prabhakar Raghavan and David Peleg and Eli Upfal}, title = {Computing with Noisy Information}, journal = {SIAM J. Comput.}, volume = {23}, number = {5}, year = {1994}, issn = {0097-5397}, pages = {1001--1018}, doi = {http://dx.doi.org/10.1137/S0097539791195877}, publisher = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, }
author = {P.A. Scarf & X. Shi}, title = {Measuring the importance of a match in a tournament}, journal = {Computers and Operations Research (to appear)}, year = {2006}, } @inproceedings{Adler94selection, author = "Adler and Gemmell and Harchol-Balter and Karp and Kenyon", title = "Selection in the Presence of Noise: The Design of Playoff Systems", booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)", year = "1994", url = "citeseer.ist.psu.edu/article/adler95selection.html" }
ISSN = {0006-3444}, abstract = {If team $A$ played team $B$ in its previous match of a round robin tournament and is now playing team $C$, team $C$ is said to receive a carry-over effect due to team $B$. This paper investigates the construction of draws for round robin tournaments with the aim of distributing the carry-over effects due to any team as evenly as possible amongst the other teams. A balanced distribution is shown to occur when the number of teams is a power of two, and a method of construction of draws is given for these cases. It is conjectured that balanced draws do not exist for other numbers of teams, and the most effective method of construction yet found for this latter situation is presented.}, author = {Russell, K. G.}, copyright = {Copyright 1980 Biometrika Trust}, journal = {Biometrika}, jstor_articletype = {Full Length Article}, jstor_date = {198004}, jstor_formatteddate = {Apr., 1980}, keywords = {Balanced draw, Carry-over effect, Construction, Cyclic development, Galois field, Round robin tournament}, month = {apr}, number = {1}, pages = {127--131}, publisher = {Biometrika Trust}, title = {Balancing Carry-Over Effects in Round Robin Tournaments}, url = {http://links.jstor.org/sici?sici=0006-3444%28198004%2967%3A1%3C127%3ABCEIRR%3E2.0.CO%3B2-4}, volume = {67}, year = {1980}, }
author = "Ian Anderson", title= "Combinatorial Designs and Tournaments", publisher = "Oxford University Press", year = 1997 }
author = "David, H. A.", title= "The method of paired comparisons", publisher = "Hafner, New York", year = 1963 }
ISSN = {0002-9890}, author = {Hwang, F. K.}, copyright = {Copyright 1982 Mathematical Association of America}, journal = {The American Mathematical Monthly}, jstor_articletype = {Full Length Article}, jstor_date = {198204}, jstor_formatteddate = {Apr., 1982}, month = {apr}, number = {4}, pages = {235--239}, publisher = {Mathematical Association of America}, title = {New Concepts in Seeding Knockout Tournaments}, url = {http://links.jstor.org/sici?sici=0002-9890%28198204%2989%3A4%3C235%3ANCISKT%3E2.0.CO%3B2-U}, volume = {89}, year = {1982}, }
ISSN = {0002-9890}, author = {Schwenk, Allen J.}, copyright = {Copyright 2000 Mathematical Association of America}, journal = {The American Mathematical Monthly}, jstor_articletype = {Full Length Article}, jstor_date = {200002}, jstor_formatteddate = {Feb., 2000}, month = {feb}, number = {2}, pages = {140--150}, publisher = {Mathematical Association of America}, title = {What is the Correct Way to Seed a Knockout Tournament?}, url = {http://links.jstor.org/sici?sici=0002-9890%28200002%29107%3A2%3C140%3AWITCWT%3E2.0.CO%3B2-J}, volume = {107}, year = {2000} }
ISSN = {0030-364X}, abstract = {Tournaments are used to select a single winner from a group of participants in a sporting event or a paired-comparison experiment. This study compares different draws, or pairings, of teams in single-elimination tournaments under a set of relatively nonrestricting assumptions about the participating teams' pairwise probabilities of winning. We analyze and compare draws for four-team tournaments using various criteria, then attempt to generalize the results to eight-team tournaments. For example, only one-four team draw maximizes the probability that the best team wins for all pairwise probabilities, whereas eight draws are possibly optimal for eight-team tournaments.}, author = {Horen, J. and Riezman, R.}, copyright = {Copyright 1985 INFORMS}, journal = {Operations Research}, jstor_articletype = {Full Length Article}, jstor_date = {198503/198504}, jstor_formatteddate = {Mar. - Apr., 1985}, keywords = {237 pairing teams in single-elimination tournaments, 570 pairing teams in single-elimination tournaments}, month = {mar}, number = {2}, pages = {249--262}, publisher = {INFORMS}, title = {Comparing Draws for Single Elimination Tournaments}, url = {http://links.jstor.org/sici?sici=0030-364X%28198503%2F04%2933%3A2%3C249%3ACDFSET%3E2.0.CO%3B2-%23}, volume = {33}, year = {1985} }
AUTHOR={Frederick Mosteller}, TITLE={Remarks on the methods of paired comparisons: I, The least squares solution assuming equal standard deviations and equal correlations. II, The effect of an aberrant standard deviation when equal standard deviations and equal correlations are assumed. III, A test of significance for paired comparisons when equal standard deviations and equal correlations are assumed.}, JOURNAL={Psychometrika}, YEAR=1951, VOLUME={16}, NUMBER={2}, PAGES={207-218}, MONTH={June} }
ISSN = {0006-3444}, author = {Bradley, R. A. and Terry,M. E.}, copyright = {Copyright 1952 Biometrika Trust}, journal = {Biometrika}, jstor_articletype = {Full Length Article}, jstor_date = {195212}, jstor_formatteddate = {Dec., 1952}, month = {dec}, number = {3/4}, pages = {324--345}, publisher = {Biometrika Trust}, title = {Rank Analysis of Incomplete Block Designs: I. The Method of Paired Comparisons}, url = {http://links.jstor.org/sici?sici=0006-3444%28195212%2939%3A3%2F4%3C324%3ARAOIBD%3E2.0.CO%3B2-C}, volume = {39}, year = {1952} } @TECHREPORT{Ryvkin:05, AUTHOR={Dmitry Ryvkin}, TITLE={The Predictive Power of Noisy Elimination Tournaments}, YEAR=2005, MONTH=Mar, INSTITUTION={The Center for Economic Research and Graduate Education - Economic Institute, Prague} }
author = "Tullock, G.", title= "Toward a Theory of the Rent-seeking Society", publisher = "Texas A\&M University Press", year = 1980 } @article{Rosen:86, ISSN = {0002-8282}, author = {Rosen, Sh.}, copyright = {Copyright 1986 American Economic Association}, journal = {The American Economic Review}, jstor_articletype = {Full Length Article}, jstor_date = {198609}, jstor_formatteddate = {Sep., 1986}, language = {EN}, month = {sep}, number = {4}, pages = {701--715}, publisher = {American Economic Association}, title = {Prizes and Incentives in Elimination Tournaments}, url = {http://links.jstor.org/sici?sici=0002-8282%28198609%2976%3A4%3C701%3APAIIET%3E2.0.CO%3B2-U}, volume = {76}, year = {1986} }
AUTHOR={Loury, G. C.}, TITLE={Market Structure and Innovation}, JOURNAL={The Quarterly Journal of Economics}, YEAR=1979, VOLUME={93}, NUMBER={3}, PAGES={395-410}, MONTH={August} }
author = {J{\'e}r{\^o}me Lang and Maria Silvia Pini and Francesca Rossi and Kristen Brent Venable and Toby Walsh}, title = {Winner Determination in Sequential Majority Voting}, booktitle = {IJCAI}, year = {2007}, pages = {1372-1377}, ee = {http://www.ijcai.org/papers07/Papers/IJCAI07-221.pdf}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{Hazon:07, author = {N. Hazon and P. E. Dunne and S. Kraus and M. Wooldridge}, title = {How to Rig an Election}, booktitle = {The 9th Bar-Ilan Symposium on the Foundations of Artificial Intelligence}, Download 1.9 Mb. Share with your friends:
|