This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Participatory_budgeting_algorithm
rdfs:label
Participatory budgeting algorithm
rdfs:comment
A participatory budgeting (PB) algorithm is an algorithm for implementing participatory budgeting. The inputs to a PB algorithm are: a list of possible projects that require funding, the total available budget for funding the projects, and the preferences of voters over the project. The output of a PB algorithm is a partition of budget among the projects - determining how much money to allocate to each project. A PB algorithm can treat the projects as either divisible or indivisible:
dcterms:subject
dbc:Computational_social_science dbc:Participatory_budgeting dbc:Electoral_systems
dbo:wikiPageID
60419824
dbo:wikiPageRevisionID
1075679554
dbo:wikiPageWikiLink
dbr:Greedy_algorithm dbr:Condorcet_criterion dbr:Truthful_mechanism dbr:Chamberlin-Courant_rule dbr:Pareto_optimal dbr:Knapsack_problem dbr:Method_of_Equal_Shares dbr:Core_(game_theory) dbr:Lars_Edvard_Phragmén dbr:Multi-winner_voting dbr:Participatory_budgeting dbr:Schwartz_set dbr:Justified_representation dbr:Multiwinner_voting dbr:Resource_monotonicity dbr:Proportional_representation dbr:Approval_voting dbc:Participatory_budgeting dbr:Strategyproofness dbc:Electoral_systems dbr:Ranked_voting dbr:Preference_elicitation dbc:Computational_social_science dbr:Implicit_utilitarian_voting
owl:sameAs
n9:A12jR wikidata:Q65063535
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Direct_Democracy dbt:Rp
dbo:abstract
A participatory budgeting (PB) algorithm is an algorithm for implementing participatory budgeting. The inputs to a PB algorithm are: a list of possible projects that require funding, the total available budget for funding the projects, and the preferences of voters over the project. The output of a PB algorithm is a partition of budget among the projects - determining how much money to allocate to each project. A PB algorithm can treat the projects as either divisible or indivisible: * A divisible PB algorithm may allocate any amount of money to any project, as long as the sum of allocations equals the budget. It is suited for projects in which each additional dollar can be used effectively, such as charity donations. * An indivisible PB algorithm takes, as additional inputs, the costs of the projects. It returns a subset of the projects, such that the total cost of the selected projects does not exceed the budget. Each selected project is allocated its entire cost, while each unselected project is allocated nothing. It is better suited for projects which must be entirely funded in order to operate, such as constructing new buildings.
prov:wasDerivedFrom
wikipedia-en:Participatory_budgeting_algorithm?oldid=1075679554&ns=0
dbo:wikiPageLength
16549
foaf:isPrimaryTopicOf
wikipedia-en:Participatory_budgeting_algorithm