Sciweavers

159 search results - page 2 / 32
» Computational Complexity of Fundamental Problems in Social C...
Sort
View
ICDCSW
2006
IEEE
13 years 10 months ago
Interdomain Routing as Social Choice
Interdomain routing is essential to both the stability and efficiency of the global Internet. However, most previous studies focus only on stability, and only on a special class ...
Ronny Ramzi Dakdouk, Semih Salihoglu, Hao Wang, Ha...
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
12 years 7 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
ECIS
2003
13 years 6 months ago
Application of the theory of organized activity to the coordination of social information systems
Co-ordination is seen as a fundamental aspect of organisational activity where computers can help. This is motivated by the need to reconcile the conflicts that arise from the div...
José A. Moinhos Cordeiro, Joaquim Filipe
ATAL
2005
Springer
13 years 10 months ago
Enforceable social laws
In this paper we study the enforcement of social laws in artificial social systems using a control system. We define the enforceable social law problem as an extension of Tennen...
Guido Boella, Leendert W. N. van der Torre
ATAL
2010
Springer
13 years 5 months ago
Complexity of judgment aggregation: safety of the agenda
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
Ulle Endriss, Umberto Grandi, Daniele Porello