Jelly, 17 14 bytes

ċⱮ6Ḣ©+$®aĖUṀ)M

Try it online!

A monadic link that takes a list of the two lists as its argument and returns [1] for player 1 wins, [2] for player 2 wins and [1, 2] for a tie. TIO link tidies this up for display.

Thanks to @JonathanAllan for saving 3 bytes!

Explanation

 ) | For each input list (e.g. of one list 1,1,3,3,4)
ċⱮ6 | - Count each of 1..6 (e.g. 2,0,2,1,0,0)
 $ | - Following as a monad:
 Ḣ | - Head (number of 1s)
 ©︎ | - Copy to register
 + | - Add (e.g. 2,4,3,0,0)
 ®a | - Register logical and with this
 Ė | - Enumerate (e.g. [1,2],[2,4],[3,3],[4,0],[5,0])
 U | - Reverse each (e.g. [2,1],[4,2],[3,3],[0,4],[0,5])
 Ṁ | - Max (e.g. 4,2)
 M | Index/indices of maximal score

R, 115 96 bytes

-6 bytes thanks to Giuseppe.

-6 bytes thanks to Aaron Hayman.

-2 bytes thanks to Arnauld, following the output format in his JavaScript answer.

function(i,j)(f(i)-f(j))/0
f=function(x,s=tabulate(x,6),l=s[1]+s[-1]*!!s[1])max(l)*6+order(l)[5]

Try it online!

Returns Inf for P1, NaN for a tie, -Inf for P2.

Uses the helper function f which computes a score for each hand. The score is defined as follows: let d be the digit which is repeated the most, and n the number of times it is repeated. Then the score is 6*n+d if there is at least one ace, and 0 if there are no aces. We then just need to find the player with the highest score.

Ungolfed:

f = function(x) 
 s = tabulate(x, 6) # number of occurrences of each integer
 l = s[1] + s[-1] * !!s[1] # add the number of wild aces to all values; set to 0 if s[1] == 0
 max(l) * 6 + # highest number of repetitions (apart from aces)
 order(l)[5] # most repeated integer (take largest in case of tie)

function(i, j)
 sign(f(i) - f(j))

JavaScript (ES6),  97  90 bytes

Takes input as (a)(b). Returns +Infinity for P1, -Infinity for P2 or NaN for a tie.

a=>b=>((g=(x,m)=>x>6?m*/1/.test(a):g(-~x,a.map(k=>n+=k<2|k==x,n=x/6)|m>n?m:n))()-g(a=b))/0

Try it online!

Commented

a => b => ( // a[] = dice of P1; b[] = dice of P2
 ( g = ( // g is a recursive function taking:
 x, // x = dice value to test; initially, it is either undefined
 // or set to a non-numeric value
 m // m = maximum score so far, initially undefined
 ) => //
 x > 6 ? // if x is greater than 6:
 m * /1/.test(a) // return m, or 0 if a[] does not contain any 1 
 : // else:
 g( // do a recursive call:
 -~x, // increment x (or set it to 1 if it's non-numeric)
 a.map(k => // for each dice value k in a[]:
 n += // add 1 to n if:
 k < 2 | // k is equal to 1
 k == x, // or k is equal to x
 n = x / 6 // start with n = x / 6
 ) | // end of map()
 m > n ? // if m is defined and greater than n:
 m // pass m unchanged
 : // else:
 n // update m to n
 ) // end of recursive call
 )() // first call to g, using a[]
 - g(a = b) // subtract the result of a 2nd call, using b[]
) / 0 // divide by 0 to force one of the 3 consistent output values

05AB1E, 16 15 bytes

-1 byte thanks to JonathanAllan

εWΘ*6L¢ć+°ƶà}ZQ

Try it online!

Returns [1, 0] for P1 wins, [1, 1] for ties, [0, 1] for P2 wins.

Rather than using lexicographic order on a 2-tuple (dice count, dice value), this computes the score as 10**dice count * dice value. Hands without a 1 score 5.

ε } # map each hand to its computed score
 WΘ # minimum == 1 (1 if the hand contains a 1, 0 otherwise)
 * # multiply (sets hands without 1 to [0, 0, 0, 0, 0])
 6L # range [1..6]
 ¢ # count occurences of each in the hand
 ć # head extract (stack is now [2-count, ..., 6-count], 1-count)
 + # add the 1-count to all the other counts
 ° # 10**x
 ƶ # multiply each element by its 1-based index
 à # take the maximum

Z # maximum
 Q # equality test (vectorizes)

Python 2, 85 81 80 bytes

lambda p:cmp(*[max((h.count(i)+h.count(i>1),i)*(1in h)for i in[6]+h)for h in p])

Try it online!

Returns 1 for P1, 0 for tie, and -1 for P2.

_{-1 byte, thanks to squid}

Perl 6, 60 49 bytes

&[cmp]o*.map:.1&&max (.2..6X+.1)Z ^5o&bag

Try it online!

Returns More, Same, Less for P1 Wins, Tie, P2 Wins.

Explanation

 *.map: # Map input lists
 &bag # Convert to Bag
 o # Pass to block
 .1&& # Return 0 if no 1s
 max # Maximum of
 .2..6 # number of 2s,3s,4s,5s,6s
 X+.1 # plus number of 1s
 ( )Z # zipped with
 ^5 # secondary key 0,1,2,3,4
&[cmp]o # Compare mapped values

T-SQL query, 148 bytes

Using table variable as input

p: player

v: value for roll

DECLARE @ table(p int,v int)
INSERT @ values(1,5),(1,5),(1,5),(1,5),(1,5)
INSERT @ values(2,4),(2,3),(2,3),(2,1),(2,4)

SELECT sign(min(u)+max(u))FROM(SELECT(p*2-3)*(s+sum(sign(s)-1/v))*(s/5*5+v+30)u
FROM(SELECT*,sum(1/v)over(partition by p)s FROM @)c GROUP BY v,s,p)x

Try it online

Player 1 wins returns -1
Tie returns 0 
Player 2 wins returns 1

Jelly, 21 bytes

^{crushed before I even posted it by Nick Kennedy :)}

’-oÆṃṀ$$Ạ?fÆṃ$L;$o5)M

A monadic Link accepting a list of players which outputs a list of (1-indexed) winners.

So P1 is [1], P2 is [2] and a tie is [1,2].

Try it online!

Java 8, 244 240 236 215 bytes

a->b->int c[][]=new int[2][7],m[]=new int[2],s,p,i=5;for(;i-->0;c[1][b[i]]++)c[0][a[i]]++;for(i=7;i-->2;)for(p=2;p-->0;m[p]=s>m[p]?s:m[p])s=c[p][1]>0?i+9*(c[p][i]+(i>1?c[p][1]:0)):0;return Long.compare(m[0],m[1]);

-4 bytes thanks to @someone.

-21 bytes thanks to @Neil.

Returns 1 if P1 wins; -1 if P2 wins; 0 if it's a tie.

Try it online.

Explanation:

a->b-> // Method with 2 integer-array parameters & integer return
 int c[][]=new int[2][7], // Create a count-array for each value of both players,
 // initially filled with 0s
 m[]=new int[2], // The maximum per player, initially 0
 s,p, // Temp-values for the score and player
 i=5;for(;i-->0; // Loop `i` in the range (5, 0]:
 c[1] // For player 2:
 [b[i] // Get the value of the `i`'th die,
 ]++) // and increase that score-count by 1
 c[0][a[i]]++; // Do the same for player 1
 for(i=7;i-->2;) // Then loop `i` in the range (7, 2]:
 for(p=2;p-->0 // Inner loop `p` over both players:
 ; // After every iteration:
 m[p]=s>m[p]?s:m[p]) // Update the max score if the current score is higher
 s= // Set the current score to:
 c[p][1]>0? // If at least one 1 is rolled:
 i // Use the current value `i`
 +9* // With 9 times the following added:
 (c[p][i] // The amount of dice for value `i`
 +(i>1? // And if the current die `i` is not 1:
 c[p][1]:0))// Add the amount of dice for value 1
 :0; // Else (no 1s were rolled): the score is 0
 return Long.compare(m[0],m[1]);
 // Finally compare the maximum scores of the players,
 // resulting in -1 if a<b; 0 if a==b; 1 if a>b

PowerShell, 112 126 123 121 bytes

Takes input as (a)(b). Returns -1 for P1 win, 1 for P2 or 0 for a tie.

$args|%%$m=$_;(7*(($o=($_-eq1).Count)+$m.Count)+$m.Name+6*!$m)[!$o])-$d
[math]::Sign($d)

Try it online!

Test case @( @(1,1,5,1,1), @(1,1,1,1,1), 1) added.

Unrolled:

$args|%%$max=$_ # $max is an element with the widest group and the maximum digit except 1
 $ones=($_-eq1).Count # number of 1s in a player's hand
 $scoreRaw=7*($ones+$max.Count)+$max.Name+6*!$max # where $max.Name is digit of the widest group
 $scoreRaw[!$ones] # output $scoreRaw if the array contains 1, otherwise output $null 
 ) # powershell deletes all variables created inside the scope on exit
 $diff=$score-$diff

[math]::Sign($diff) # output the score difference

Wolfram Language (Mathematica), 78 75 74 bytes

-1 byte by Greg Martin

Order@@(#~FreeQ~1||Last@Sort[Reverse/@Tally@Flatten[#/. 1->Range@6]]&)/@#&

Try it online!

Outputs -1 when player 1 wins, 1 when player 2 wins, and 0 for a tie.

 Helper function to score a list:
FreeQ[#,1] || If there are 0 1s, score is True
Last@Sort[ Otherwise, take the largest element of
 Reverse/@Tally@ the frequency, number pairs in the flat list
 Flatten[ #/. 1->Range@6] where each 1 is replaced by 1,2,3,4,5,6.
]& e.g. 1,3,3,5,5 -> 1,2,3,4,5,6,3,3,5,5 -> 3,5

Order @@ (...) /@ #& Apply this function to both lists,
 then find the ordering of the result.

Jelly, 27 bytes

’o5Rṗ5¤ṢŒr$€UẎṀ1e⁸¤×µ€_/Ṡo/

Try it online!

1 for P1, -1 for P2, 0 for tie

Explanation

’o5Rṗ5¤ṢŒr$€UẎṀ1e⁸¤×µ€_/Ṡo/ Main link
 µ€ For each list
’ Decrement each value (so 1s become falsy)
 o Vectorized logical or (this replaces previous 1s (now 0s) with the test values)
 5Rṗ5¤ 1..5 cartesian-power 5 (1,1,1,1,1; 1,1,1,1,2; 1,1,1,1,3; ...)
 $€ For each test list
 ṢŒr Sort and run-length encode (gives [digit, #digit])
 U Reverse each list (gives [#digit, digit])
 Ẏ Tighten by one (gives a list containing each possible hand for each possible wildcard)
 Ṁ Take the maximum
 1e⁸¤× Multiply the list values by (whether or not the original contained a 1) - becomes [0, 0] if not
 _/Ṡ Take the sign of the difference between the #digits and the digits
 o/ If the number of digits differs, then 1/-1 is returned; otherwise, check the value of the digit (could still be 0)

Sledgehammer 0.4, 27 bytes

⢱⢙⢂⠠⡾⢃⠐⢈⠸⣞⠴⠻⠎⡥⡳⡐⢒⠘⢛⣩⡓⣮⡕⡠⣢⣡⠿

Decompresses into this Wolfram Language function:

Order @@ (FreeQ[#1, 1] || Last[Sort[Reverse[Tally[Flatten[#1 /. 1 -> Range[6]]], 2]]] & ) /@ #1 & 

which turns out to be exactly the same as my Mathematica answer.

Charcoal, 48 45 bytes

ＵＭθ⮌Ｅ⁷№ι∨λ¹ＵＭθ׬¬⊟ι⁺⊟ιιＵＭθ⟦⌈ι±⌕ι⌈ι⟧Ｉ⁻⌕θ⌈θ⌕θ⌊θ

Try it online! Link is to verbose version of code. Takes input as an array of arrays and outputs -1 if player 1 wins, 0 for a tie, and 1 if player 2 wins. Explanation:

ＵＭθ⮌Ｅ⁷№ι∨λ¹

Replace each hand with the count of how many times the values 6..1 appear in the hand. The list is reversed because a) it makes it easier to find the highest value with the highest count and b) it makes it easier to remove the count of 1s. The count of 1s is doubled because it needs to be removed twice, once to check that it is nonzero and once to add it to the other counts.

ＵＭθ׬¬⊟ι⁺⊟ιι

Add the count of 1s to the counts for 6..2, but set all of the counts to zero if the count of 1s was zero.

ＵＭθ⟦⌈ι±⌕ι⌈ι⟧

For each hand find the highest count and the highest value with that count. (Actually we find value minus 6 as that's golfier.)

Ｉ⁻⌕θ⌈θ⌕θ⌊θ

Determine which hand won by subtracting the positions of the winning and losing hands. (If the hands are tied then the first hand is both winning and losing so the result is 0 as desired.)

C (gcc) / 32 bit, 117 bytes

t;m;s(int*r)int c[6]=;for(m=0;t=*r++;m=t>m?t:m)c[--t]+=5,t=t?c[t]+t:5;t=*c?*c+m:0;f(a,b)t=s(a)-s(b);t=(t>0)-!t;

Try it online!

Takes two zero-terminated integer arrays. Returns 1, 0, -1 for P1 Wins, P2 Wins, Tie.

J, ⁴⁷ 44 bytes

*@-&([:(.([:>./#@]+9^*@[*+).)1#.i.@6=/<:)

Try it online!

Inspired by Nick Kennedy's idea.

ungolfed

*@-&([: (. ([: >./ #@] + 9 ^ *@[ * +) .) 1 #. i.@6 =/ <:)

Perl 5 -MList::Util=max -pl, 80 bytes

sub t$_=t($_)<=>t<>

Try it online!

Input:

Each player on a separate line, no spaces

Output:

1 Line one wins

0 Tie

-1 Line two wins