algorithm - NP-Hard? Algorithmic complexity of online poker collusion detection? -


What is the best way to describe the algorithmic complexity of collusion identity for the ten million-player online poker site?

Suppose (I do not think this perception makes a difference, so feel free to ignore them, but just to make it clear):

  • Site There are over 10,000,000 registered users.
  • These players have played 5 billion hands in total.
  • This information is only "Master Hand History Database" for the information given to you site, in which all player holes are included in the card and betting work for each hand.
  • In other words, you can not take shortcuts like checking the IP address, looking for unusual rake / profit pattern, and so forth.
  • Assume that you have been given a function which, when actually N (where N is between 2 and 10) is passed to a group of players, TRUE returns if all of the group Players have worked together if anything but all players are not colloidals, then FALSE gives the function. A return value of TRUE is done with 75% trust (for example).

Your job is to prepare a complete list of those players, which is in line with the complete list of players, I am recently associated with this problem as NP-Hard Have heard, but is this right? Sometimes we call things "NP" or "NP-Hard" which are simply "tough".

Thank you!

I immediately see that there is force-force approach: 

  Set Colugues = New Set (); (Player P1: All Players) {Player Player 2: AllPlayer} {if (! P1Ajel (P2) and Heldlded (P1, P2)) {colluders.add (p1); Colluders.add (P2); }}}

I do not see any point to call, with logic greater than 2, because it can give wrong negative. I think that it depends on how expensive this work is, but the above results in O (n ^ 2) are called to call (N-player number). The function seems to be O (m), where I have the number of games that they played together. Thus, under the algorithm O (N ^ 3), looks well . To be NP-hard, you can "l have a problem h np-hard if and if only one np-full problem is l, then polynomial time can be turing-reducing to h [...] in other words With an oracle for H, an oracle machine should be resolved in polynomial time. " I have studied NP-complete problems (for example 3-SAT, Traveling salesman problem etc.) and I do not know how you will prove it. But then, it looks like suspicion.


Comments

Post a Comment

Popular posts from this blog

python - Overriding the save method in Django ModelForm -

I'm having trouble overriding a ModelForm save method. I get this error I'm: Exception type: TypeErier Exception Value: Save () found an unexpected keyword argument 'committed' My intentions include a form 3 fields Submit several values ​​for, then create an object for each combination of those areas, and to save each object file models.py class collarsult type (models.Model): id = model. AutoField (db_column = 'icontact_result_code_type_id', primary_key = true) callResult = models.ForeignKey ( 'CallResult', db_column = 'icontact_result_code_id') campaign = models.ForeignKey ( 'campaign', db_column = 'icampaign_id') CALLTYPE = models.ForeignKey ( 'CALLTYPE', db_column = 'icall_type_id') agent = models.BooleanField (db_column = 'bagent', default = true) teamLeader = models.BooleanField (db_column = 'bTeamLeader', default = true) active = models.BooleanField (db_column = Django.form...
Read more

html - CSS autoheight, but fit content to height of div -

I have a div in which there are three children- div in the left and middle div: float: left while true: float: true because it is my layout Actually will spoil, I've used ClearFix Hack: .cf {zoom: 1; }. Cf: First,. Cf: {content: ""; Display: Table; }. Cf: After {clear: both; } It still works, but I want to be the right div an indicator. So it should fill 100% of the parent unit of height. How can I complete this? PS is the full code: & Lt; / Div & gt; & Lt; Div class = "mobile_content" & gt; & Lt; H5 & gt; {{Data.titel}} & lt; / H5> & Lt; Table & gt; & Lt; TR & gt; & Lt; Th & gt; Komponist: & lt; / Th & gt; & Lt; TD & gt; {{Data.komponist}} & lt; / TD & gt; & Lt; / TR & gt; & Lt; TR & gt; & Lt; Th & gt; Instrument: & lt; / Th & gt; & Lt; TD & gt; {{Data.instrumente}} & lt; / TD & gt; & Lt; / TR & gt;...
Read more

qt - How to prevent QAudioInput from automatically boosting the master volume to 100%? -

I have been trying to use Qt5 multimedia to record audio with QAudioInput, however, when I see If QAudioInput is started, it increases the master volume of my sound device to 100%. How can I prevent QAudioInput from changing the master volume? My current development platform is Linux with PalsAdio (with flat audio disabled). How can I use QAudioInput : QAudioDeviceInfo device_info = QAudioDeviceInfo :: defaultInputDevice (); QAudio format format; Format.setSampleRate (44100); Format.setChannelCount (1); Format.setSampleSize (16); Format.setCodec ("Audio / PCM"); Format.setSampleType (QAudioFormat :: SignedInt); Format.setByteOrder (QAudioFormat :: LittleEndian); Std :: cout & lt; & Lt; Device_info.deviceName (). ToUtf8 (). ConstData () & lt; & Lt; Std :: endl; QAudioInput * default_device = new QAudioInput (device_info, format); QIODevice * default_io_device = default_device-> Start (); a QAudioInput.setVolume () method is not you I ...
Read more