Filters








9 Hits in 4.0 sec

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving [article]

Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist
2017 arXiv   pre-print
Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable.  ...  To the best of our knowledge, this is the first application of SMT solvers in computational social choice.  ...  Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. Technical Report. http://arxiv.org/abs/1604.05692. F. Brandl, F. Brandt, C. Geist, and J. Hofbauer. 2015.  ... 
arXiv:1604.05692v4 fatcat:ixsi7gcfenexniafwl74qth5wa

Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving

Florian Brandl, Felix Brandt, Manuel Eberl, Christian Geist
2018 Journal of the ACM  
Two important requirements when aggregating the preferences of multiple agents are that the outcome should be economically efficient and the aggregation mechanism should not be manipulable.  ...  To the best of our knowledge, this is the first application of SMT solvers in computational social choice.  ...  Proving the Result In this section, we first reduce the statement of Theorem 1 to the case of m = 4 and n = 4, which we then prove via SMT solving.  ... 
doi:10.1145/3125642 fatcat:psgz7zepnnaslal6bnuhpwqkmq

Computational Social Choice: The First Ten Years and Beyond [chapter]

Haris Aziz, Felix Brandt, Edith Elkind, Piotr Skowron
2019 Lecture Notes in Computer Science  
Computational social choice is a research area at the intersection of computer science, mathematics, and economics that is concerned with aggregation of preferences of multiple agents.  ...  social choice, random assignment, and computer-aided theorem proving.  ...  The second result shows the incompatibility of SD-efficiency and weak SD-strategyproofness and strengthens a number of previous impossibilities [32] .  ... 
doi:10.1007/978-3-319-91908-9_4 fatcat:u5nezniajbe53lwvb6u3e3rfwy

Finding Strategyproof Social Choice Functions via SAT Solving

Felix Brandt, Christian Geist
2016 The Journal of Artificial Intelligence Research  
Our contribution is two-fold: We present an efficient encoding for translating such problems to SAT and leverage this encoding to prove new results about strategyproofness with respect to Kelly's and Fishburn's  ...  Furthermore, we explain how human-readable proofs of such results can be extracted from minimal unsatisfiable cores of the corresponding SAT formulas.  ...  comments and suggestions to improve the paper.  ... 
doi:10.1613/jair.4959 fatcat:hxokiycad5dhzgvo44fezwv2ye

Fast Iterative Combinatorial Auctions via Bayesian Learning [article]

Gianluca Brero, Sébastien Lahaie, Sven Seuken
2019 arXiv   pre-print
To achieve fast convergence, current CAs require careful tuning of the price update rule to balance convergence speed and allocative efficiency.  ...  Iterative combinatorial auctions (CAs) are often used in multi-billion dollar domains like spectrum auctions, and speed of convergence is one of the crucial factors behind the choice of a specific design  ...  Acknowledgments Part of this research was supported by the SNSF (Swiss National Science Foundation) under grant #156836.  ... 
arXiv:1809.05340v6 fatcat:f7op2jcbzfbx3mxdrmmex75hh4

Fast Iterative Combinatorial Auctions via Bayesian Learning

Gianluca Brero, Sébastien Lahaie, Sven Seuken
2019 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
To achieve fast convergence, current CAs require careful tuning of the price update rule to balance convergence speed and allocative efficiency.  ...  Iterative combinatorial auctions (CAs) are often used in multibillion dollar domains like spectrum auctions, and speed of convergence is one of the crucial factors behind the choice of a specific design  ...  Acknowledgments Part of this research was supported by the SNSF (Swiss National Science Foundation) under grant #156836.  ... 
doi:10.1609/aaai.v33i01.33011820 fatcat:wbnljqt4srfm3h5mw3kdqtanta

A formal proof of the Incompatibility of SD-Efficiency and SD-Strategy-Proofness

Manuel Eberl
2019
and SMT solvers to prove a conjecture by Aziz et al. that no anonymous and neutral randomised voting rule (known as Social Decision Scheme) can fulfil the notions of both SD-Efficiency and SD-Strategy-Proofness  ...  , including the parts previously done by the Java program, the SMT solver, and informal pen-and-paper reasoning. • developing a 'human-readable' version of the SMT proof, i. e. a proof that is both detailed  ...  [BBG16] proved the incompatibility of SD-Efficiency and weak SD-Strategy-Proofness for anonymous and neutral SDSs using SMT solvers -without the additional problematic assumption about Random Dictatorship  ... 
doi:10.14459/2016md1485242 fatcat:cokomapajbgj3imaqa62smc6dq

Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)

Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, Albert Cohen, Alastair Donaldson, Marieke Huisman, Joost-Pieter Katoen, Stephen Kobourov, Martin Nöllenburg, Monique, Sergiu Hart (+2 others)
2013 unpublished
I discuss the problem definition, the variations and different objectives, and the pitfalls. I also survey the classical algorithms of Douglas and Peucker; Imai and Iri; and of Chan and Chin.  ...  -Correct and Efficient Accelerator Programming the new parallel algorithms show considerable runtime improvements compared to their counterparts on standard architectures.  ...  We show that efficiency and strategyproofness are incompatible to some extent when preferences are defined using stochastic dominance (SD) and therefore introduce a natural weakening of SD based on Savage's  ... 
fatcat:m7452gw4cvecbd2vi6w3uha5ai

Electronic Markets and Auctions (Dagstuhl Seminar 13461) Computational Models of Language Meaning in Context (Dagstuhl Seminar 13462) Synchronous Programming (Dagstuhl Seminar 13471) Global Measurement Framework (Dagstuhl Seminar 13472) Unleashing Operational Process Mining (Dagstuhl Seminar 13481) Forensic Computing (Dagstuhl Seminar 13482)

Saul Greenberg, Kasper Hornbaek, Aaron Quigley, Harald Reiterer, Roman, Yishay Mansour, Benny Moldovanu, Noam Nisan, Berthold, Hans Kamp, Alessandro Lenci, James (+14 others)
2013 unpublished
Two EC FP7 research projects, Leone and mPlane, kindly supported the social event of the seminar.  ...  The seminar can be seen as a good starting point to identify the role of Proxemics in Human-Computer Interaction.  ...  We show that efficiency and strategyproofness are incompatible to some extent when preferences are defined using stochastic dominance (SD) and therefore introduce a natural weakening of SD based on Savage's  ... 
fatcat:fl5xhx4dpbeklg6o6xhmuvuety