With respect to non-plutocratic governance and building upon discussion to create a conflict commitee, and appointing trusted decision makers for Code of Conduct Enforcement we would like to present the community with learning about the  limitations, tradeoffs and emergent risks of different voting methods to inform the design around committee election or sortion.

This work stems from and looks to build upon the COMSOC Course under development  via TE Academy as a recipient of RetroActive Public Goods Funding for Token Engineering Education The knowledge they are building has application throughout the web3 ecosystem, that we believe can help develop our collective understanding of governance with direct application to decisions regarding Code of Conduct Enforcement. This learning session is delivered in conjunction with a working demostration of Pairwise, signalling mechanism for possible use with committee election.

This open learning session is presented by Nimrod Talmon, a tenured assistant professor at Ben-Gurion University and a consultant for technological companies in the crypto sector. His main research is in the intersection of computational social choice, combinatorial optimization, and decentralized governance in the context of decentralized autonomous organizations (DAO). He is a regularly published authority in publications including AAAI, IJCAI, and AAMAS, and serves on the program committee of these conferences.

COMSOC EVENT DETAILS DATE TIME LOCATION TBD PAIRWISE DEMO WORKSHOP DATE TIME LOCATION TBD

Intro to Computational Social Choice (COMSOC)

Voting serves an important function within decentralised communities, enabling political and functional autonomy. Even when choosing popular voting  methods that seem intuitively fair there is a need to assess the limitations, tradeoffs and emergent risks of different voting methods. It is important to recognise that the choices we make about how to vote can lead to less than desirable outcomes.

Computational Social Choice (COMSOC) -  the design and analysis of algorithmic principles - can help communities assess, select or design voting methods with consideration to decision types, decision rights, governance structure and systems. **COMSOC presents axioms, theorems, and mathematical verdicts to help

When communities need to vote on decisions, COMSOC perspectives can aid principled design to help increase real and perceived fairness, the likelihood of positive outcomes and facilitate understanding and optimisation of  governance.

Consideration for Code of Conduct Enforcement

In the process of decentralizing Code of Conduct enforcement from the Optimism Foundation to the community COMSOC can offer the following approaches to guide decisions around preference aggregation and voting systems

Axioms are precise, defined properties of voting rules that express desired behaviour(s)  - such as fairness - which voting rules should satisfy. Mathematical verdicts and resulting theorems are applied to prove which voting methods meet which axioms to help communities choose between different voting methods.  As an example, when deciding on which voting rules to choose, communities can

  1. define properties that the voting rules should satisfy (i.e. fairness)