Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

3

IPL
2016

favoriteEmaildiscussreport

43views more IPL 2016»

On the complexity of exchanging

8 years 23 days ago

On the complexity of exchanging

Download upcommons.upc.edu

We analyze the computational complexity of the problem of deciding whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning coalitions. We also look at the problem of turning winning coalitions into losing coalitions. We analyze the problem when the simple game is represented by a list of wining, losing, minimal winning or maximal loosing coalitions.

Xavier Molinero, Martin Olsen, Maria J. Serna

Real-time Traffic

IPL 2016 |

claim paper

Related Content

» Exchange market for complex commodities search for optimal matches

» Communication complexity of document exchange

» A Note on the Complexity of Breaking OkamotoTanaka IDBased Key Exchange Scheme

» Exchange Market Equilibria with Leontiefs Utility Freedom of Pricing Leads to Rationality

» Indexing Distributed Complex Data for Complex Queries

» Multiattribute Exchange Market Theory and Experiments

» How Efficient Can Gossip Be On the Cost of Resilient Information Exchange

» Semantically Rich Recommendations in Social Networks for Sharing Exchanging and Ranking Se...

» Multiattribute exchange market representation and indexing of orders

» A NonCommutative Generalization of ElGamal Key Exchange using Polycyclic Groups

Post Info
More Details (n/a)

Added	05 Apr 2016
Updated	05 Apr 2016
Type	Journal
Year	2016
Where	IPL
Authors	Xavier Molinero, Martin Olsen, Maria J. Serna

Comments (0)