Filters








3,366 Hits in 4.5 sec

Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers [chapter]

Xudong Liu, Miroslaw Truszczynski
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Voting in Combinatorial Domains Denote by I the set of issues vote is a strict total order on X and a profile is a finite collection of votes.  ...  Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for instances of practical sizes.  ...  Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for instances of practical sizes.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-41575-3_19">doi:10.1007/978-3-642-41575-3_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/efgmmlgmhvfubpfimp7gd3woda">fatcat:efgmmlgmhvfubpfimp7gd3woda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190304073006/http://pdfs.semanticscholar.org/c305/7ec7b283b20cc9f0f8b170ca57ec6f9e0427.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c3/05/c3057ec7b283b20cc9f0f8b170ca57ec6f9e0427.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-41575-3_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

ANSWER SET PROGRAMMING AND COMBINATORIAL MULTICRITERIA DECISION MAKING

RAFAL GRABOŚ
<span title="">2006</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2mchw27ezjaivoukjltsyavclq" style="color: black;">International Journal of Uncertainty Fuzziness and Knowledge-Based Systems</a> </i> &nbsp;
In this paper Logic Programming with Ordered Disjunction (LPOD), an extension of answer set programming for handling preferences, is used for representing and solving combinatorial vote problems.  ...  Various vote rules, used as procedures for determining optimal candidate for a group of voters, are defined by means of preference relations between answer sets of a program, representing a vote problem  ...  In this paper, we study logic programming approach to combinatorial voting.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218488506004096">doi:10.1142/s0218488506004096</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vel32z6hqneg3nni3jfu6gcu5a">fatcat:vel32z6hqneg3nni3jfu6gcu5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170812195431/http://drops.dagstuhl.de/opus/volltexte/2005/262/pdf/05171.GrabosRafal.Paper.262.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e1/8d/e18d4046aa59f2871c11ace47444dded3bb6b36d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218488506004096"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Comparing multiagent systems research in combinatorial auctions and voting

Vincent Conitzer
<span title="">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j2td7x4trvgx7pjoienrccryxq" style="color: black;">Annals of Mathematics and Artificial Intelligence</a> </i> &nbsp;
In a combinatorial auction, a set of resources is for sale, and agents can bid on subsets of these resources.  ...  In a voting setting, the agents decide among a set of alternatives by having each agent rank all the alternatives. Many of the key research issues in these two domains are similar.  ...  In summary, many of the same issues are at play in combinatorial auctions and voting settings.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-010-9205-y">doi:10.1007/s10472-010-9205-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7tbreanrrrhmjjorivhzzaow6a">fatcat:7tbreanrrrhmjjorivhzzaow6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100616185545/http://isaim2008.unl.edu/PAPERS/SS2-SocialChoice/VConitzer-ss2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f8/38/f838531623a37cf6f47bddb6a75d608906242138.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-010-9205-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 1185 of Mathematical Reviews Vol. , Issue 91B [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
For each question, the first answers given were combinatorial, and in general they ignored the ideological positions of voters. Geometry was brought in to model the effects of ideology.  ...  via fuzzy mathematical programming and cooperative games.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-02_91b/page/1185" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991-02_91b/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Preface

Flavio Ferrarotti, Stefan Woltran
<span title="2019-08-14">2019</span> <i title="Springer Science and Business Media LLC"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j2td7x4trvgx7pjoienrccryxq" style="color: black;">Annals of Mathematics and Artificial Intelligence</a> </i> &nbsp;
-The paper Voting-based Ensemble Learning for Partial Lexicographic Preference Forests over Combinatorial Domains by Xudong Liu and Mirosław Truszczyński is located in the area of preferences, and brings  ...  This means that quite often, in order to answer a given query it is not necessary to know to which sets each object (or group of objects) belongs to; it is enough to know in how many sets each object (  ...  List of Reviewers Publisher's note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-019-09667-1">doi:10.1007/s10472-019-09667-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/olcrp5b5tjdypocn2emuuy7pgu">fatcat:olcrp5b5tjdypocn2emuuy7pgu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307063357/https://link.springer.com/content/pdf/10.1007%2Fs10472-019-09667-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/da/c0dac2e130f65240f577a71141d723fe3dbb7788.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10472-019-09667-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Computing in Mechanism Design [chapter]

Tuomas Sandholm
<span title="">2008</span> <i title="Palgrave Macmillan UK"> The New Palgrave Dictionary of Economics </i> &nbsp;
Expressive mechanisms have also been designed for settings beyond auctions, such as combinatorial exchanges, charity donations, and settings with externalities.  ...  in polynomial time using linear programming.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/978-1-349-95121-5_2327-1">doi:10.1057/978-1-349-95121-5_2327-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lwxvp2xtyzahtmtggmunikitdq">fatcat:lwxvp2xtyzahtmtggmunikitdq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080906163629/http://www-2.cs.cmu.edu/~sandholm/cs15-892F07/computing%20in%20mech%20design.Palgrave.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a3/40/a340b83f93d498e6a0fdc43e134fe41d5b929d66.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1057/978-1-349-95121-5_2327-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Exact Algorithms for Weighted and Unweighted Borda Manipulation Problems [article]

Yongjie Yang, Jiong Guo
<span title="2013-04-10">2013</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
of this case in general settings.  ...  In this paper, we initiate the study of exact combinatorial algorithms for both weighted and unweighted Borda manipulation problems.  ...  These results answer an open problem posed by Betzler et al. [2] . In addition, we present an integer linear programming based algorithm with running time O * (2 9m 2 log m ) for UBM.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1304.3145v1">arXiv:1304.3145v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/znld2ambazhxtn446v6ty4jewe">fatcat:znld2ambazhxtn446v6ty4jewe</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1304.3145/1304.3145.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1304.3145v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Algorithmic Decision Theory Meets Logic [chapter]

Jérôme Lang
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
set programming) model checking (and more) Combination of both: representation and resolution of complex problems.  ...  Judy now votes yes for u, yes for t and no for h Defeasible Beliefs vs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-23264-5_2">doi:10.1007/978-3-319-23264-5_2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4wh5xtprazewnobjpthch4sl3q">fatcat:4wh5xtprazewnobjpthch4sl3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200321051626/https://www.mat.unical.it/calimeri/lpnmr2015/talks/LPNMR%202015-s3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cc/0a/cc0a8242096873293a0978fbf50dae7cef987b55.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-23264-5_2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Possible Optimality and Preference Elicitation for Decision Making [chapter]

Nawal Benabbou
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
As a next step, we can study the potential of incremental elicitation methods in combinatorial voting (i.e. the set of alternatives has a combinatorial structure) with partial preference profiles.  ...  As future work, we plan to study combinatorial voting with partial preference profiles.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-23114-3_34">doi:10.1007/978-3-319-23114-3_34</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fbjwi5oetjelte7umaidbyrm5m">fatcat:fbjwi5oetjelte7umaidbyrm5m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427110258/https://hal.sorbonne-universite.fr/hal-01217672/file/consortium.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f3/7a/f37afff0d4480afbe418031caf5919d4b277d3f2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-23114-3_34"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Vote trading and subset sums

Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger
<span title="">2015</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/z7xgofryqjgkxjlwzlky45v4li" style="color: black;">Operations Research Letters</a> </i> &nbsp;
We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied voteswapping parties, the problem is polynomially solvable.  ...  We are grateful to the organizers of this meeting and to the Dagstuhl staff for providing a stimulating atmosphere.  ...  Acknowledgments Part of this work was started during the Schloss Dagstuhl seminar 12101 on ''Computation and Incentives in Social Choice''.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.orl.2014.12.007">doi:10.1016/j.orl.2014.12.007</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6tar2vzisvbfba3itfrqq5tmau">fatcat:6tar2vzisvbfba3itfrqq5tmau</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813083020/https://pure.tue.nl/ws/files/3950371/687508338315905.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/98/c3/98c36a49ef0ae612db41dad2f8dbba6ca4cd437b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.orl.2014.12.007"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Short Introduction to Computational Social Choice [chapter]

Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet
<span title="">2007</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
On the one hand, it is concerned with the application of techniques developed in computer science, such as complexity analysis or algorithm design, to the study of social choice mechanisms, such as voting  ...  Computational social choice is an interdisciplinary field of study at the interface of social choice theory and computer science, promoting an exchange of ideas in both directions.  ...  In what follows, we give some examples for the issues at stake for different types of problem in social choice. voting -When the set of candidates has a combinatorial structure, even simple voting rules  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-69507-3_4">doi:10.1007/978-3-540-69507-3_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lajqmwaqhfe7fmx2vxwnarpyce">fatcat:lajqmwaqhfe7fmx2vxwnarpyce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070824012712/http://www.illc.uva.nl/Publications/ResearchReports/PP-2006-55.text.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/95/1a/951ad4fd292a167f68dc81406a083dfb3e39399e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-69507-3_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 7828 of Mathematical Reviews Vol. , Issue 2003j [page]

<span title="">2003</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Summary: “Logic programs under answer sets semantics can be studied, and actual computation can be carried out when the pro- grams are represented by directed graphs.  ...  In this paper, we develop (a) the complete framework for the CFEM fault classification, (b) the voting functions applicable under the CFEM, and (c) the funda- mental distributed services of consensus and  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2003-10_2003j/page/7828" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2003-10_2003j/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Recognising Multidimensional Euclidean Preferences [article]

Dominik Peters
<span title="2016-02-25">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We also study dichotomous preferencesand the behaviour of other metrics, and survey a variety of related work.  ...  This model, also known as multidimensional unfolding, has applications in economics, psychometrics, marketing, and many other fields.  ...  ACKNOWLEDGMENTS I thank Edith Elkind and Martin Lackner for helpful discussions, and Jürgen Bokowski for correspondence about the theory of oriented matroids.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.08109v1">arXiv:1602.08109v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zia5vx642bggdlvviwidvavw6a">fatcat:zia5vx642bggdlvviwidvavw6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200907004001/https://arxiv.org/pdf/1602.08109v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/23/fb/23fbd671f8efaffbdbbc8338af390091c1c6e2ea.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1602.08109v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Page 476 of Mathematical Reviews Vol. , Issue 89A [page]

<span title="">1989</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Algorithms for constructing the arrangement and convex hulls are given. One chapter each is de- voted to linear programming and to planar point location.  ...  , the oracle answers YES if x lies in K and otherwise provides a hyperplane separating x from K. For details of this and related models of convexity the reader should consult a book by L.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1989-01_89a/page/476" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1989-01_89a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Using Mechanism Design to Prevent False-Name Manipulations

Vincent Conitzer, Makoto Yokoo
<span title="2010-09-20">2010</span> <i title="Association for the Advancement of Artificial Intelligence (AAAI)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/27wksbinzzhjfow2wuy6m2iefm" style="color: black;">The AI Magazine</a> </i> &nbsp;
, we can find some methodology that directly prevents false-name manipulation even in such settings, so that we are back in a more typical mechanism design context.  ...  One may react to these impossibility results by saying that, since false-name-proof mechanisms are unsatisfactory, we should not run any important mechanisms in highly anonymous settings—unless, perhaps  ...  Voting We will first discuss voting settings.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1609/aimag.v31i4.2315">doi:10.1609/aimag.v31i4.2315</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ui63kipscjaabjfa7zz3kquxua">fatcat:ui63kipscjaabjfa7zz3kquxua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151020025650/http://www.aaai.org/ojs/index.php/aimagazine/article/download/2315/2183" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9e/fb/9efb864dd6ca4c34c162ccc36119963df606754b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1609/aimag.v31i4.2315"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,366 results