Sciweavers

2024 search results - page 70 / 405
» The cost of social agents
Sort
View
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
15 years 10 months ago
The price of anarchy of finite congestion games
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
George Christodoulou, Elias Koutsoupias
ATAL
2008
Springer
14 years 11 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
ICCCI
2010
Springer
14 years 8 months ago
Identifying Representative Reviewers in Internet Social Media
Abstract. In a society, we have many forms of relations with other people from home, work or school. These relationships give rise to a social network. People in a social network r...
Sang-Min Choi, Jeong-Won Cha, Yo-Sub Han
114
Voted
CHI
2010
ACM
14 years 6 months ago
Expressive robots in education: varying the degree of social supportive behavior of a robotic tutor
Teaching is inherently a social interaction between teacher and student. Despite this knowledge, many educational tools, such as vocabulary training programs, still model the inte...
Martin Saerbeck, Tom Schut, Christoph Bartneck, Ma...
IDC
2009
Springer
15 years 4 months ago
Cost of Cooperation for Scheduling Meetings
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
Alon Grubshtein, Amnon Meisels