Intelligence }



Download 1.9 Mb.
Page11/15
Date02.02.2017
Size1.9 Mb.
#15283
1   ...   7   8   9   10   11   12   13   14   15

author={L. Ausubel and P. Milgrom},

title={Ascending auctions with package bidding},

year={2001},

note={ Mimeo, University of Maryland}

}

@inproceedings{ParkesUngar,



author={D. C. Parkes and L. H. Ungar},

title={Iterative combinatorial auctions: Theory and practice},

booktitle={AAAI,IAAI},

pages={74--81},

year={2000}

}
@article{HonSela,

author={S. Hon-Snir and D. Monderer and A. Sela},

title={A Learning Approach to Auctions},

journal={Journal of Economic Theory},

year={1998},

volume={82},

pages={65--88}

}
@article{Furedi,

author = {Z. F\"uredi},

title = {Covering pairs by $q^2+q+1$ sets},

journal ={Journal of Combinatorial Theory Ser. A},

volume = {54},

number={2},

pages={248--271},

year = {1990}

}

@Book{Demb,



author = {P. Dembowski},

title = {Finite Geometries},

publisher = {Springer},

year = {1968}

}
@unpublished{Ausubel2000,

author= "L. Ausubel",

title= "An efficient dynamic auction for heterogeneous commodities",

year= "2000",

note= "Mimeo, University of Maryland"

}
@book{Seligman,

author={M.E.P Seligman},

title={Learned Optimism},

booktitle={Journal of Humanistic Psychology},

publisher={NY Knopf},

year={1991}}
@article{Irwin,

author={F.W. Irwin},

title={Stated expectations as a function of probability and

desiarability of outcomes},

journal={Journal of Personality},

volume={21},

pages={329-335},

year={1953}}


@article{Marks,

author={R. W. Marks},

title={The effect of probability, desirability, and "priviledge" on the

stated expectations of children},

journal={Journal of Personality},

volume={19},

pages={332--351},

year={1951}}

@inproceedings{Greenwald,

AUTHOR = "A. Greenwald",

TITLE ="{Shopbots and Pricebots}",

BOOKTITLE = {the 16th International Joint Conference on Artificial

Intelligence},

YEAR = {1999},

pages={506--511}

}
@inproceedings{ParkesUngar00,

AUTHOR = "D.C. Parkes and L.H. Ungar",

TITLE ="{Preventing Strategic Manipulation in Iterative Auctions:

Proxy-Agents and Price-Adjustment}",

BOOKTITLE = {the 17th National Conference on Artificial

Intelligence},

YEAR = {2000},

pages={82--89}

}

@article{SLAST,



author={T. Sandholm and K. Larson and M. Anderson and O. Shehory

and F. Tombe},

title={Coalition Structure Generation with Worst Case Guarantees},

volume={111},

number={1--2},

pages={209--238},

journal={Artificial Intelligence},

year={1999}}

@InProceedings{BT01,

author = {R.~I.~Brafman and M.~Tennenholtz},

title = {R-max -- A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning},

booktitle = {IJCAI'01},

year = {2001},

}
@TechReport{BT-COOR-TR,

author = {R.~I.~Brafman and M.~Tennenholtz},

title = {Learning to Coordinate Efficiently: A Model-Based Approach},

institution = {Dept. of Computer Science, Ben-Gurion University},

year = {2002},

number = {02-05}

}
@TechReport{BT-ELE-TR,

author = {R.~I.~Brafman and M.~Tennenholtz},

title = {Efficient Learning Equilibrium},

institution = {Dept. of Computer Science, Ben-Gurion University},

year = {2002},

number = {02-06}

}
@article{BTELE,

author = {R.~I.~Brafman and M.~Tennenholtz},

title = {Efficient Learning Equilibrium},

JOURNAL = "Artificial Intelligence",

YEAR = 2004,

VOLUME = 159,

PAGES = "27--47"

}

@unpublished{BTELEnips,



author = {R.~I.~Brafman and M.~Tennenholtz},

title = {Efficient Learning Equilibrium},

note= "Proceedings of NIPS 2003 (Full version to appear in Artificial Intelligence (AIJ))",

year = "2004"

}
@unpublished{STTCS,

author = {Y. Shoham and M.~Tennenholtz},

title = {Non-Cooeartive

Computation: Boolean Functions with Correctness and Exclusivity},

note={Theoretical Computer Science (TCS), to appear},

year={2004}}


@unpublished{PST,

author={R. Porter and Y. Shoham and M. Tennenholtz},

title={Fair Imposition},

note={Journal of Economic Theory (JET), to appear},

year={2004}}
@unpublished{SPG,

author={Y. Shoham and R. Powers and T. Grenager},

title={Multi-Agent Reinforcement Learning: A Critical Survey},

note={Technical Report, Stanford University},

year={2004}}
@inproceedings{GPS,

AUTHOR = "R. Powers and T. Grenager and Y. Shoham",

TITLE ="{Dispersion Games}",

BOOKTITLE = {Proceedings of AAAI-02},

YEAR = {2002}}
@inproceedings{PRST,

AUTHOR = "R. Porter and A. Ronen and Y. Shoham and M. Tennenholtz",

TITLE ="{Mechanism Design with Execution Uncertainty}",

BOOKTITLE = {Proceedings of UAI-02},

YEAR = {2002}}
@InProceedings{PRAX,

author = {Alon Altman and Moshe Tennenholtz},

title = {Ranking systems: the {PageRank} axioms},

booktitle = {EC '05: Proceedings of the 6th ACM conference on Electronic commerce},

year = {2005},

isbn = {1-59593-049-3},

pages = {1--8},

location = {Vancouver, BC, Canada},

doi = {http://doi.acm.org/10.1145/1064009.1064010},

publisher = {ACM Press},

address = {New York, NY, USA}

}
@article{ google,

author = "Sergey Brin and Lawrence Page",

title = "The anatomy of a large-scale hypertextual {Web} search engine",

journal = "Computer Networks and ISDN Systems",

volume = "30",

number = "1--7",

pages = "107--117",

year = "1998",

url = "citeseer.ist.psu.edu/brin98anatomy.html" }


@unpublished{litigation-reputation,

author = "Yannis Bakos and Chrysanthos N. Dellarocas",

title = "Cooperation Without Enforcement? A Comparative Analysis of Litigation and Online Reputation as Quality Assurance Mechanisms",

YEAR = 2003,

NOTE = {MIT Sloan School of Management Working Paper No. 4295-03},

url = "http://ssrn.com/abstract=393041"

}
@unpublished{digitation-wom,

author = "Chrysanthos N. Dellarocas",

title = "The Digitization of Word-of-Mouth: Promise and Challenges of Online Feedback Mechanisms",

YEAR = 2003,

NOTE = {MIT Sloan School of Management Working Paper No. 4296-03},

url = "http://ssrn.com/abstract=393042"

}
@ARTICLE{Bajari,

AUTHOR={ Bajari, Patrick and Hortacsu, Ali},

TITLE={ The Winner's Curse, Reserve Prices, and Endogenous Entry: Empirical Insights from eBay Auctions},

JOURNAL={RAND Journal of Economics},

YEAR=2003,

VOLUME={34},

NUMBER={2},

PAGES={329-55},

MONTH={Summer},

NOTE={available at http://ideas.repec.org/a/rje/randje/v34y2003i2p329-55.html}

}
@unpublished{Dewan,

AUTHOR={S. Dewan and V. Hsu},

TITLE={Trust in Electronic Markets: Price Discovery in Generalist Versus Specialty Online Auctions},

NOTE={Working Paper.},

YEAR={2001},

MONTH={January}

}
@unpublished{Houser,

AUTHOR={D. Houser, and J. Wooders},

TITLE={Reputation in auctions: Theory and evidence from eBay},

NOTE={Working Paper, University of Arizona},

YEAR={2000}

}
@TECHREPORT{Lucking-Reiley,

AUTHOR={Doug Bryan and David Lucking-Reiley and Naghi Prasad and Daniel Reeves},

TITLE={Pennies from eBay: the Determinants of Price in Online Auctions},

YEAR=2000,

MONTH=Jan,

INSTITUTION={Vanderbilt - Economic and Business Administration},

TYPE={Papers},

NOTE={available at http://ideas.repec.org/p/fth/vander/00-w03.html},

NUMBER={00-w03}

}
@unpublished{resnick-zeckhauser,

AUTHOR={P. Resnick and R. Zeckhauser},

TITLE={ Trust Among Strangers in Internet Transactions: Empirical Analysis of eBay's Reputation System},

NOTE={Working Paper for the NBER workshop on empirical studies of electronic commerce},

YEAR=2001,

MONTH={January}

}
@ARTICLE{SeqEq,

AUTHOR={Kreps, David M and Wilson, Robert},

TITLE={Sequential Equilibria},

JOURNAL={Econometrica},

YEAR=1982,

VOLUME={50},

NUMBER={4},

PAGES={863-94},

MONTH={July},

NOTE={available at http://ideas.repec.org/a/ecm/emetrp/v50y1982i4p863-94.html}

}
@Article{Garfield,

author = "Eugene Garfield",

title = "Citation Analysis as a Tool in Journal Evaluation",

journal = "Science",

volume = "178",

pages = "471--479",

year = "1972",

}
@inproceedings{Lehmann99,

author = "Daniel J. Lehmann and Liaden Ita O'Callaghan and Yoav Shoham",

title = "Truth revelation in approximately efficient combinatorial auctions",

booktitle = "{ACM} Conference on Electronic Commerce",

pages = "96--102",

year = "1999",

url = "citeseer.ist.psu.edu/lehmann99truth.html" }


@phdthesis{parkes01b,

title = {Iterative Combinatorial Auctions: Achieving Economic and Computational

Efficiency},

author = {David C. Parkes},

school = {Department of Computer and Information Science, University of Pennsylvania},

year = {2001},

month = {May},

www_section = {Iterative (Combinatorial) Auctions},

www_html_url = {http://www.eecs.harvard.edu/~parkes/diss.html},

}
@inproceedings{ConitzerHowMany,

author = {Vincent Conitzer and J\'{e}r\^{o}me Lang and Tuomas Sandholm},

title = {How many candidates are needed to make elections hard to manipulate?},

booktitle = {Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge},

year = {2003},

isbn = {1-58113-731-1},

pages = {201--214},

location = {Univerity of Indiana, Indiana},

doi = {http://doi.acm.org/10.1145/846241.846268},

publisher = {ACM Press},

}
@article{may52,

author = {May, Kenneth O.},

title = {A Set of Independent, Necessary and Sufficient Conditions for Simple

Majority Decision},

journal = {Econometrica},

year = {1952},

volume = {20},

number = {4},

pages = {680--84}

}
@article{NashBargaining,

author={J.F. Nash},

title={The Bargaining Problem},

journal={Econometrica},

volume={18},

pages={155--162},

year={1950}

}
@article{ID3,

author = {J. R. Quinlan},

title = {Induction of Decision Trees},

journal = {Machine Learning},

volume = {1},

number = {1},

year = {1986},

issn = {0885-6125},

pages = {81--106},

doi = {http://dx.doi.org/10.1023/A:1022643204877},

publisher = {Kluwer Academic Publishers},

address = {Hingham, MA, USA},

}
@article{SVM,

author = {C. Cortes and V. Vapnik},

title = {Support-Vector Networks},

journal = {Machine Learning},

volume = {20},

number = {3},

year = {1995},

issn = {0885-6125},

pages = {273--297},

doi = {http://dx.doi.org/10.1023/A:1022627411411},

publisher = {Kluwer Academic Publishers},

address = {Hingham, MA, USA},

}
@article{jackson,

AUTHOR={Dutta, Bhaskar and Jackson, Matthew O and Le Breton, Michel},

TITLE={Strategic Candidacy and Voting Procedures},

JOURNAL={Econometrica},

YEAR=2001,

VOLUME={69},

NUMBER={4},

PAGES={1013-37}

}
@article{borodin-link,

author = {Allan Borodin and Gareth O. Roberts and Jeffrey S. Rosenthal and Panayiotis Tsaparas},

title = {Link analysis ranking: algorithms, theory, and experiments},

journal = {ACM Trans. Inter. Tech.},

volume = {5},

number = {1},

year = {2005},

issn = {1533-5399},

pages = {231--297},

doi = {http://doi.acm.org/10.1145/1052934.1052942},

publisher = {ACM Press},

address = {New York, NY, USA}

}
@ARTICLE{volij-ijgt,

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}

}
@inproceedings{AFRS,

author = {Alon Altman and

Moshe Tennenholtz},

title = {On the Axiomatic Foundations of Ranking Systems.},

booktitle = ijcai05,

year = {2005},

pages = {917-922},

ee = {http://www.ijcai.org/papers/0374.pdf},

bibsource = {DBLP, http://dblp.uni-trier.de}

}
@inproceedings{ec06incentives,

author={Alon Altman and Moshe Tennenholtz},

title={Incentive Compatible Ranking Systems},

booktitle = {Proc. of AAMAS-07},

location = {Honolulu, Hawaii, USA},

year={2007}}


@inproceedings{Sybilproof,

author = {Alice Cheng and Eric Friedman},

title = {Sybilproof reputation mechanisms},

booktitle = {P2PECON '05: Proceeding of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems},

year = {2005},

isbn = {1-59593-026-4},

pages = {128--132},

location = {Philadelphia, Pennsylvania, USA},

doi = {http://doi.acm.org/10.1145/1080192.1080202},

publisher = {ACM Press},

address = {New York, NY, USA},

}
@inproceedings{moletrust,

author = {Paolo Avesani and Paolo Massa and Roberto Tiella},

title = {A trust-enhanced recommender system application: Moleskiing},

booktitle = {SAC '05: Proceedings of the 2005 ACM symposium on Applied computing},

year = {2005},

isbn = {1-58113-964-0},

pages = {1589--1593},

location = {Santa Fe, New Mexico},

doi = {http://doi.acm.org/10.1145/1066677.1067036},

publisher = {ACM Press},

address = {New York, NY, USA},

}
@inproceedings{epinions-trust,

author = {Paolo Massa and

Paolo Avesani},

title = {Controversial Users Demand Local Trust Metrics: An Experimental

Study on Epinions.com Community.},

booktitle = {Proc. of AAAI-05},

year = {2005},

pages = {121-126},

bibsource = {DBLP, http://dblp.uni-trier.de}}
@misc{personalizing-pagerank,

author = "T. Haveliwala and S. Kamvar and G. Jeh",

title = "An analytical comparison of approaches to personalizing {PageRank}",

note = "Technical report, Stanford University.",

year = "2003",

url = "citeseer.ist.psu.edu/haveliwala03analytical.html" }


@Misc{RFC2440,

author = "J. Callas and L. Donnerhacke and H. Finney and R.

Thayer",

title = "{RFC 2440}: Open{PGP} Message Format",

month = nov,

year = "1998",

bibdate = "Tue Dec 22 18:40:48 MST 1998",

note = "Status: PROPOSED STANDARD.",

URL = "ftp://ftp.internic.net/rfc/rfc2440.txt,

ftp://ftp.math.utah.edu/pub/rfc/rfc2440.txt",

acknowledgement = "Nelson H. F. Beebe, University of Utah, Department

of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake

City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1

801 585 1640, +1 801 581 4148, e-mail:

\path|beebe@math.utah.edu|, \path|beebe@acm.org|,

\path|beebe@ieee.org| (Internet), URL:

\path|http://www.math.utah.edu/~beebe/|",

format = "TXT=141371 bytes",

online = "yes",

status = "PROPOSED STANDARD",

}
@PHDTHESIS{advogato-thesis,

AUTHOR = {Raph Levien},

TITLE = {{Attack Resistant Trust Metrics}},

SCHOOL = {{University of California, Berkeley}},

YEAR = {{2002}},

URL = {http://www.levien.com/thesis/compact.pdf}

}
@inproceedings{kic,

author = {Alon Altman and

Moshe Tennenholtz},

title = {Quantifying Incentive Compatibility of Ranking Systems.},

booktitle = AAAI06,

year = {2006},

bibsource = {DBLP, http://dblp.uni-trier.de}

}

@article{CostaGomes,



AUTHOR={Costa-Gomes, Miguel and Crawford, Vincent P and Broseta, Bruno},

TITLE={Cognition and Behavior in Normal-Form Games: An Experimental Study},

JOURNAL={Econometrica},

YEAR=2001,

VOLUME={69},

NUMBER={5},

PAGES={1193-1235},

MONTH={September}

}

@article{Camerer,



AUTHOR={Colin F. Camerer and Teck-Hua Ho and Juin-Kuan Chong},

TITLE={A Cognitive Hierarchy Model of Games},

JOURNAL={The Quarterly Journal of Economics},

YEAR=2004,

VOLUME={119},

NUMBER={3},

PAGES={861-898},

MONTH={August}

}
@inproceedings{nudelman-run,

author = {Eugene Nudelman and

Jennifer Wortman and

Kevin Leyton-Brown},

title = {Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic

Algorithms},

booktitle = {Proceedings for AAMAS 2004},

year = {2004},

pages = {880-887},

ee = {http://csdl.computer.org/comp/proceedings/aamas/2004/2092/02/20920880abs.htm},

bibsource = {DBLP, http://dblp.uni-trier.de}

}
@inproceedings{gal04learning,

author = {Ya'akov Gal and

Avi Pfeffer and

Francesca Marzo and

Barbara J. Grosz},

title = {Learning Social Preferences in Games.},

booktitle = AAAI04,

year = {2004},

pages = {226-231},

}
@book{KagelRoth95,

title={The Handbook of Experimental Economics},

editor={J.H. Kagel and E.A. Roth},

publisher={Princeton University Press},

year={1995}}
@unpublished{ErevEno,

author={I. Erev and A. Roth and R. Slonim and G. Barron},

title={Learning and equilibrium as useful approximations: accuracy of prediction on randomly selected constant sum games},

year={2006}}


@inproceedings{personalized,

author={Alon Altman and Moshe Tennenholtz},

title={An Axiomatic Approach to Personalized Ranking Systems},

booktitle=ijcai07,

year={2007},

}
@inproceedings{rankinggames,

author = {Felix Brandt and

Felix A. Fischer and

Yoav Shoham},

title = {On Strictly Competitive Multi-Player Games.},

booktitle = AAAI06,

year = {2006},

bibsource = {DBLP, http://dblp.uni-trier.de}

}
@book{crypto-stinson,

author = {Douglas Stinson},

title = {Cryptography: Theory and Practice,Second Edition},

year = {2002},

isbn = {1584882069},

publisher = {CRC/C\&H},

}

@incollection{CollectiveCoin,



AUTHOR = "M. Ben-Or and N. Linial",

TITLE = "{Collective coin flipping}",

EDITOR = "S. Micali",

BOOKTITLE = "Randomness and Computation",

PUBLISHER = "Academic Press, New York",

pages={91--115},

YEAR = 1989

}
@inproceedings{leader-cheater,

author = {Spyridon Antonakopoulos},

title = {Fast leader-election protocols with bounded cheaters' edge},

booktitle = {STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing},

year = {2006},

isbn = {1-59593-134-1},

pages = {187--196},

location = {Seattle, WA, USA},

doi = {http://doi.acm.org/10.1145/1132516.1132544},

publisher = {ACM Press},

address = {New York, NY, USA},

}
@PROCEEDINGS{DBLP:conf/aaai/2006,

title = {Proceedings, The Twenty-First National Conference on Artificial

Intelligence and the Eighteenth Innovative Applications

of Artificial Intelligence Conference, July 16-20, 2006,

Boston, Massachusetts, USA},

booktitle = {AAAI},

publisher = {AAAI Press},

year = {2006},

ISBN = {978-1-57735-281-5}

}

@article{PositionAuctions,



abstract = {I analyze the equilibria of a game based on the ad auction used by Google and Yahoo. This auction is closely related to the assignment game studied by Shapley-Shubik, Demange-Gale-Sotomayer and Roth-Sotomayer. However, due to the special structure of preferences, the equilibria of the ad auction can be calculated explicitly and some known results can be sharpened. I provide some empirical evidence that the Nash equilibria of the position auction describe the basic properties of the prices observed in Google's ad auction reasonably accurately.},

author = {Varian, Hal R.},

citeulike-article-id = {2963650},

citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.ijindorg.2006.10.002},

citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0167718706001317},

citeulike-linkout-2 = {http://www.sciencedirect.com/science/article/B6V8P-4MC0T69-1/1/0cadfec6cf7b226e1d5853e82565e739},

doi = {10.1016/j.ijindorg.2006.10.002},

journal = {International Journal of Industrial Organization},

keywords = {advertising, auctions, internet\_auctions, paper\_02\_search\_engine\_competition, search\_engines},

month = {December},

number = {6},

pages = {1163--1178},

posted-at = {2008-07-04 11:57:37},

priority = {0},

title = {Position auctions},

url = {http://dx.doi.org/10.1016/j.ijindorg.2006.10.002},

volume = {25},

year = {2007}

}

@book{Lynch96,



AUTHOR = {Lynch, Nancy A.},

TITLE = {Distributed Algorithms},

YEAR = {1996},

PUBLISHER = {Morgan Kaufmann},

SERIES = {},

}
@ARTICLE{dichotomous,

AUTHOR={Bogomolnaia, Anna and Moulin, Herve and Stong, Richard},

TITLE={Collective choice under dichotomous preferences},

JOURNAL={Journal of Economic Theory},

YEAR=2005,

VOLUME={122},

NUMBER={2},

PAGES={165-184},

MONTH={June},

NOTE={available at http://ideas.repec.org/a/eee/jetheo/v122y2005i2p165-184.html}

}

@book{stokey-lucas,



author = {Stokey, Nancy L. and Lucas, Robert E. },

citeulike-article-id = {106145},

howpublished = {Hardcover},

isbn = {0674750969},

keywords = {411-1, aarmacro, empirical_io, macroeconomics, tasanduskursus},

month = {November},

priority = {3},

publisher = {Harvard University Press},

title = {Recursive Methods in Economic Dynamics},

url = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20{\&}path=ASIN/0674750969},

year = {1989}

}
@ARTICLE{fishburn-approval,

AUTHOR={Fishburn, Peter C.},

TITLE={Axioms for approval voting: Direct proof},

JOURNAL={Journal of Economic Theory},

YEAR=1978,

VOLUME={19},

NUMBER={1},

PAGES={180-185},

MONTH={October},

NOTE={available at http://ideas.repec.org/a/eee/jetheo/v19y1978i1p180-185.html}

}
@ARTICLE{divdollar,

author={Geoffroy de Clippel and Herve Moulin and Nicolaus Tideman},

title={Impartial division of a dollar},

JOURNAL={Journal of Economic Theory online},

MONTH={September},

year={2007},

NOTE={Available at http://www.ruf.rice.edu/~clippel/idd.pdf}

}
@UNPUBLISHED{normativejournal,

title = {Axiomatic Foundations for Ranking Systems},

author={Alon Altman and Moshe Tennenholtz},

note={To appear in Journal of Artificial Intelligence Research},


Download 1.9 Mb.

Share with your friends:
1   ...   7   8   9   10   11   12   13   14   15




The database is protected by copyright ©ininet.org 2024
send message

    Main page